Interval routing in reliability networks

DOI10.1016/J.TCS.2004.12.008MaRDI QIDQ1770375zbMATH OpenOpenAlexFDO

Authors Cyril Gavoille, Martin Nehéz

Publication date 6 April 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.12.008

zbMATH Keywords

Random graphsCompact routing tablesInterval routingPercolation theoryReliability networks

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• The Complexity of Interval Routing on Random Graphs
• The complexity of interval routing on random graphs
• The compactness of interval routing for almost all graphs
• scientific article; zbMATH DE number 1361484
• Interval routing schemes

Cites work

• scientific article; zbMATH DE number 2013835 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1862256 (Why is no real title available?)
• scientific article; zbMATH DE number 1875437 (Why is no real title available?)
• scientific article; zbMATH DE number 2089960 (Why is no real title available?)
• (1 + εΒ) -spanner constructions for general graphs
• A survey on interval routing
• A trade-off between space and efficiency for routing tables
• Compact oracles for reachability and approximate distances in planar digraphs
• Compact routing schemes with low stretch factor
• Compact routing with minimum stretch
• Connectivity properties in random regular graphs with edge faults
• Depth-First Search and Linear Graph Algorithms
• Distance labeling in graphs (extended abstract)
• Efficient Message Routing in Planar Networks
• Expander properties in random regular graphs with edge faults
• Graph minors. III. Planar tree-width
• Interval Routing
• Labelling and Implicit Routing in Networks
• On the space requirement of interval routing
• Percolation
• Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
• Proximity-preserving labeling schemes
• Random graphs.
• Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing
• The Compactness of Interval Routing
• The Complexity of Interval Routing on Random Graphs
• The compactness of interval routing for almost all graphs
• The complexity of shortest path and dilation bounded interval routing
• The complexity of the characterization of networks supporting shortest-path interval routing.
• The small-world phenomenon: an algorithmic perspective
• Universal routing schemes
• Worst Case Bounds for Shortest Path Interval Routing

Cited in

(5)

• The complexity of interval routing on random graphs
• Ordered interval routing schemes
• Threshold dominating cliques in random graphs and interval routing
• Minimizing maximum risk for fair network connection with interval data
• Performance quality of re-routing networks: influence of equipment failure

This page was built for publication: Interval routing in reliability networks

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