Minimum 2-terminal Routing in 2-jump Circulant Graphs.
Borut RobicJanez ZerovnikPublished in: Comput. Artif. Intell. (2000)
Keyphrases
- spanning tree
- routing algorithm
- graph theoretic
- fourier transform
- connected dominating set
- least squares
- graph representation
- routing problem
- graph matching
- directed graph
- neural network
- graph theory
- shortest path
- network topology
- minimum cost
- graph databases
- ad hoc networks
- markov chain
- pairwise
- random graphs
- graph construction
- iterative methods
- routing decisions
- travel distance
- data sets