Compact Routing for Graphs Excluding a Fixed Minor.
Ittai AbrahamCyril GavoilleDahlia MalkhiPublished in: DISC (2005)
Keyphrases
- shortest path
- routing protocol
- graph theory
- graph theoretic
- graph matching
- routing algorithm
- mobile ad hoc networks
- fixed number
- graph model
- graph clustering
- bipartite graph
- weighted graph
- network topologies
- graph representation
- real time
- structured objects
- random graphs
- graph structures
- graph mining
- ad hoc networks
- directed graph
- end to end
- search algorithm
- data sets