Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Sangho ShimJozef SiránJanez ZerovnikPublished in: Discret. Appl. Math. (2002)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- graph matching
- average degree
- hamiltonian cycle
- graph theory
- bipartite graph
- graph theoretic
- graph clustering
- edge weights
- vertex set
- minimum weight
- graph kernels
- connected subgraphs
- transitive closure
- graph databases
- maximum cardinality
- real time
- random graphs
- random walk