Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs

DOI10.1007/978-3-642-36065-7_13zbMath1379.68348OpenAlexW2129606632MaRDI QIDQ4914441

Philippe Gambette, Christophe Crespelle

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)

Related Items (2)

Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Rotation distance for rank bounded trees

This page was built for publication: Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs