Edge-disjoint routing in plane switch graphs in linear time.
Jan M. HochsteinKarsten WeihePublished in: J. ACM (2004)
Keyphrases
- edge disjoint
- spanning tree
- total length
- minimum cost
- three dimensional
- routing problem
- undirected graph
- weighted graph
- routing algorithm
- simple polygon
- switched networks
- graph matching
- graph theoretic
- high speed
- graph model
- routing protocol
- graph partitioning
- inter domain
- graph theory
- shortest path
- mobile ad hoc networks
- small world
- packet switching
- worst case