Shortcutting Planar Digraphs
From MaRDI portal
Publication:4862749
DOI10.1017/S0963548300001668zbMath0839.05044MaRDI QIDQ4862749
Publication date: 5 June 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
A Hierarchy of Lower Bounds for Sublinear Additive Spanners, Transitive-Closure Spanners: A Survey, Unnamed Item, Unnamed Item, Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts, Steiner transitive-closure spanners of low-dimensional posets, Shortcutting directed and undirected networks with a degree constraint, Efficient provably-secure hierarchical key assignment schemes
Cites Work