Efficient Message Routing in Planar Networks
From MaRDI portal
Publication:3835028
DOI10.1137/0218058zbMath0678.68050OpenAlexW2039498863MaRDI QIDQ3835028
Ravi Janardan, Greg N. Frederickson
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1553&context=cstech
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99) Theory of computing (68Q99)
Related Items (16)
An optimal message routing algorithm for double-loop networks ⋮ On devising Boolean Routing Schemes ⋮ Multi-dimensional Interval Routing Schemes ⋮ Quantum routing in planar graph using perfect state transfer ⋮ On multi-label linear interval routing schemes ⋮ Compact and localized distributed data structures ⋮ Sparse covers for planar graphs and graphs that exclude a fixed minor ⋮ Not all planar digraphs have small cycle separators ⋮ Representing graphs implicitly using almost optimal space ⋮ Characterization of networks supporting multi-dimensional linear interval routing schemes ⋮ Interval routing in reliability networks ⋮ Interval routing schemes ⋮ Planar graphs, via well-orderly maps and trees ⋮ Multidimensional interval routing schemes ⋮ Static and dynamic low-congested interval routing schemes ⋮ Graph theoretical issues in computer networks
This page was built for publication: Efficient Message Routing in Planar Networks
