Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
From MaRDI portal
Publication:3408176
DOI10.1007/978-3-642-11476-2_20zbMath1274.68010OpenAlexW2115833060WikidataQ62046052 ScholiaQ62046052MaRDI QIDQ3408176
Nicolas Nisse, Ivan Rapaport, Karol Suchan
Publication date: 24 February 2010
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00741970/file/SiroccoTCSFinal.pdf
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed computing of efficient routing schemes in generalized chordal graphs
- A survey on interval routing
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- The Compactness of Interval Routing for Almost All Graphs
- Labelling and Implicit Routing in Networks
- A Unified View of Graph Searching
- Interval Routing onk-Trees
- The Compactness of Interval Routing
- A trade-off between space and efficiency for routing tables
- Object location using path separators
- Compact oracles for reachability and approximate distances in planar digraphs
- Algorithms – ESA 2005
- Estimating all pairs shortest paths in restricted graph families: a unified approach
- Graph-Theoretic Concepts in Computer Science
- Space-efficiency for routing schemes of stretch factor three
This page was built for publication: Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs