Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
type: Item
instance of: scholarly article
title: Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs
zbMATH Open document ID: 1019.90013
DOI: 10.1016/S0166-218X(01)00310-9
author: Sangho Shim
author: Jozef Širáň
author: Janez Žerovnik
published in: Discrete Applied Mathematics
publication date: 2002-08-29T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1792303
zbMATH Keywords: routing
zbMATH Keywords: shortest path
zbMATH Keywords: vertex-transitive graph
MaRDI profile type: Publication
cites work: The forwarding index of communication networks
cites work: Q5625213
cites work: On quasi-Cayley graphs
cites work: Q4352273
cites work: On forwarding indices of networks
cites work: Forwarding indices of consistent routings and their complexity
cites work: Q4523707
cites work: Q4289999
cites work: Vertex-transitive graphs that are not Cayley graphs. II
Wikidata QID: Q123136890
Recommended article: Counterexample to a conjecture of Szymanski on hypercube routing
Recommended article: Approximability of unsplittable shortest path routing problems
Recommended article: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
Recommended article: On the VC-dimension of unique round-trip shortest path systems
Recommended article: On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
Recommended article: On the Structure of Unique Shortest Paths in Graphs
Recommended article: The compactness of interval routing for almost all graphs
Recommended article: On compact and efficient routing in certain graph classes
Recommended article: Algorithms and Computation
Recommended article: On Disjoint Shortest Paths Routing on the Hypercube
description: scientific article; zbMATH DE number 1792303