The Compactness of Interval Routing
From MaRDI portal
Publication:4699171
DOI10.1137/S0895480197328631zbMath0929.68070MaRDI QIDQ4699171
Publication date: 23 November 1999
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Average stretch analysis of compact routing schemes, Interval routing in reliability networks, The compactness of adaptive routing tables, Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices, Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs