The Complexity of Interval Routing on Random Graphs

DOI10.1093/COMJNL/41.1.16MaRDI QIDQ3842955zbMATH OpenOpenAlexFDO

Authors Michele Flammini, J. Van Leeuwen, Alberto Marchetti-Spaccamela

Publication date 25 January 1999

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/17356

zbMATH Keywords

compact routingcomplete routing tables

Mathematics Subject Classification ID

Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• The complexity of interval routing on random graphs
• The compactness of interval routing for almost all graphs
• Interval routing schemes
• Interval routing schemes
• scientific article; zbMATH DE number 1760012

Cited in

(14)

• Threshold dominating cliques in random graphs and interval routing
• Interval routing in some planar networks.
• On the complexity of multi-dimensional interval routing schemes
• Interval routing in reliability networks
• The compactness of adaptive routing tables
• The complexity of the characterization of networks supporting shortest-path interval routing.
• The compactness of interval routing for almost all graphs
• Stochastic service systems, random interval graphs and search algorithms
• The complexity of interval routing on random graphs
• On the computational complexity of continuous routing
• Interval Routing onk-Trees
• Low-congested interval routing schemes for hypercubelike networks
• Compact and localized distributed data structures
• Algorithms and Computation

This page was built for publication: The Complexity of Interval Routing on Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3842955)