Distributed computing of efficient routing schemes in generalized chordal graphs

DOI10.1016/J.TCS.2012.01.006MaRDI QIDQ442251zbMATH OpenOpenAlexWikidataFDO

Authors Nicolas Nisse, Ivan Rapaport, Karol Suchan

Publication date 10 August 2012

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

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

zbMATH Keywords

distributed algorithmchordal graphstretchrouting scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Distributed computing of efficient routing schemes in generalized chordal graphs
• scientific article; zbMATH DE number 2013835
• On efficient distributed construction of near optimal routing schemes
• Compact Routing In Chordal Grids And Other Networks
• Distributed computation on graphs
• Distributed graph algorithms for computer networks
• On efficient distributed construction of near optimal routing schemes (extended abstract)
• Round- and message-optimal distributed graph algorithms
• scientific article; zbMATH DE number 1953090
• Distributed approximation of minimum routing cost trees

Cites work

• scientific article; zbMATH DE number 2013835 (Why is no real title available?)
• scientific article; zbMATH DE number 1756017 (Why is no real title available?)
• A Unified View of Graph Searching
• A survey on interval routing
• A trade-off between space and efficiency for routing tables
• Algorithmic graph theory and perfect graphs
• Algorithms – ESA 2005
• Compact oracles for reachability and approximate distances in planar digraphs
• Emergence of Scaling in Random Networks
• Estimating all pairs shortest paths in restricted graph families: a unified approach
• Graph-Theoretic Concepts in Computer Science
• Incidence matrices and interval graphs
• Interval Routing onk-Trees
• Labelling and Implicit Routing in Networks
• Memory requirement for routing in distributed networks
• Object location using path separators
• Space-efficiency for routing schemes of stretch factor three
• The Compactness of Interval Routing
• The compactness of interval routing for almost all graphs

Cited in

(8)

• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
• F-Chord: Improved uniform routing on Chord
• Distributed computing of efficient routing schemes in generalized chordal graphs
• scientific article; zbMATH DE number 1953090 (Why is no real title available?)
• scientific article; zbMATH DE number 2013835 (Why is no real title available?)
• Optimal distributed algorithms in unlabeled tori and chordal rings
• On efficient distributed construction of near optimal routing schemes

This page was built for publication: Distributed computing of efficient routing schemes in generalized chordal graphs

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