Subject: [manet] Use of Planar Graphs

From: "Sivavakeesar S Mr (PG/R - Electronic Eng)" <[email-masked]>
Date: Fri, 22 Oct 2004 18:37:44 +0100

Dear Collegues :
 
I am sure some of you can help me out. Can somebody tell me why we always use planar graph in the case of finding shortests path within a network OR perimeter OR face-routing in the case of geocasting in mobile ad hoc networks. What happens if we opt for non-planerised graphs [ie: graphs in which edges might cross each other].
 
Since I am involved with routing in MANETs using graph theory principles, can you please suggest me any book that deals with graph theory in general OR preferably in the context of networking.
 
Your timely help would be greatly appreciated.
 
Thanks in advance.
 
Cheers
 
S. Siv
 
_______________________________________________
manet mailing list
[email-masked]
https://www1.ietf.org/mailman/listinfo/manet