Additive tree 2-spanners of permutation graphs

DOI10.1080/00207160701828116MaRDI QIDQ3396414zbMATH OpenOpenAlexFDO

Authors Hon-Chan Chen, Fu-Hsing Wang

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

zbMATH Keywords

algorithmpermutation graphspanner

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics on words (68R15)

Recommendations

• Additive Tree Spanners
• Additive graph spanners
• Isomorphic tree spanner problems
• Tree Spanners
• Tree \(t\)-spanners of a graph: minimizing maximum distances efficiently

Cites work

• A model classifying algorithms as inherently sequential with applications to graph searching
• Additive graph spanners
• Additive Tree Spanners
• An Optimal Synchronizer for the Hypercube
• Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
• Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 194437 (Why is no real title available?)
• Tree 3-spanners on interval, permutation and regular bipartite graphs
• Tree Spanners

Cited in

(3)

• Additive Tree Spanners
• Collective Additive Tree Spanners of Homogeneously Orderable Graphs
• Tree 3-spanners on interval, permutation and regular bipartite graphs

This page was built for publication: Additive tree 2-spanners of permutation graphs

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