Linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs

DOI10.1007/978-3-642-36065-7_13MaRDI QIDQ4914441zbMATH OpenOpenAlexFDO

Authors Christophe Crespelle, Philippe Gambette

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_13

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• (Nearly-)tight bounds on the contiguity and linearity of cographs
• Linearity is strictly more powerful than contiguity for encoding graphs
• Linearity is strictly more powerful than contiguity for encoding graphs
• scientific article; zbMATH DE number 3896983
• The Pathwidth and Treewidth of Cographs

Cited in

(5)

• Linearity is strictly more powerful than contiguity for encoding graphs
• Linearity is strictly more powerful than contiguity for encoding graphs
• (Nearly-)tight bounds on the contiguity and linearity of cographs
• Rotation distance for rank bounded trees
• On rotation distance of rank bounded trees

This page was built for publication: Linear-time constant-ratio approximation algorithm and tight bounds for the contiguity of cographs

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