Directional Routing via Generalized st-Numberings

DOI10.1137/S0895480198333290zbMATH Open0941.68095MaRDI QIDQ4490784FDOQ4490784

Authors: Fred S. Annexstein, Kenneth A. Berman 

Publication date: 20 July 2000

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• A general methodology for direction-based irregular routing algorithms
• scientific article; zbMATH DE number 2036569
• Stackelberg Routing in Arbitrary Networks
• Dynamic Routing Schemes for General Graphs
• Direct routing: Algorithms and complexity
• Algorithms – ESA 2004
• Stabilization of general loop-free routing
• Compact roundtrip routing in directed networks
• Compact roundtrip routing in directed networks (extended abstract)

zbMATH Keywords

graph connectivitymatchings\(st\)-numberingnetwork routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cited In (4)

• A plane graph representation of triconnected graphs
• Algorithms for computing a parameterized \(st\)-orientation
• NP-completeness of st-orientations for plane graphs
• A multi-tree routing scheme using acyclic orientations

This page was built for publication: Directional Routing via Generalized st-Numberings

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