Additive tree 2-spanners of permutation graphs
From MaRDI portal
Publication:3396414
DOI10.1080/00207160701828116zbMath1175.05033OpenAlexW2102620564MaRDI QIDQ3396414
Publication date: 18 September 2009
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701828116
Trees (05C05) Combinatorics on words (68R15) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- A model classifying algorithms as inherently sequential with applications to graph searching
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Additive Tree Spanners
- An Optimal Synchronizer for the Hypercube
- Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
- Tree Spanners
- Additive graph spanners
This page was built for publication: Additive tree 2-spanners of permutation graphs