<--- Back to Details
First PageDocument Content
Graph theory / NP-complete problems / Wireless networking / Unit disk graph / Routing algorithms / Wireless ad hoc network / Routing / Topology control / Topological graph theory / Planar graph / Geographic routing / Graph coloring
Date: 2014-09-26 08:36:49
Graph theory
NP-complete problems
Wireless networking
Unit disk graph
Routing algorithms
Wireless ad hoc network
Routing
Topology control
Topological graph theory
Planar graph
Geographic routing
Graph coloring

Microsoft PowerPoint - DIALMPOMC03.ppt

Add to Reading List

Source URL: disco.ethz.ch

Download Document from Source Website

File Size: 767,87 KB

Share Document on Facebook

Similar Documents

Graph theory / Mathematics / Search algorithms / Algebraic graph theory / Graph connectivity / Adjacency matrix / Matrices / Depth-first search / Adjacency list / Breadth-first search / Graph / Topological sorting

6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

DocID: 1rsoU - View Document

Graph theory / Mathematics / Science and technology in the United States / Matching / Jeffrey Ullman / John Hopcroft / Anand Rajaraman / Bipartite graph / Topological graph theory / HopcroftKarp algorithm / Ullman

Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

DocID: 1rmf4 - View Document

Graph theory / Planar graphs / SPQR tree / Planarization / Dual graph / Topological graph theory / Biconnected graph / Simultaneous embedding / Planarity testing

UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

DocID: 1rkPg - View Document

Graph theory / Planar graphs / Topological graph theory / Graph drawing / Outerplanar graph / Crossing number / 1-planar graph

The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

DocID: 1rfkH - View Document

Graph theory / Topological graph theory / Graph / Topological graph / Planar graph / Petersen graph

Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

DocID: 1rec7 - View Document