From Tree-Width to Clique-Width: Excluding a Unit Interval Graph

DOI10.1007/978-3-540-92182-0_76zbMath1183.05070OpenAlexW1822562651MaRDI QIDQ3597886

Vadim V. Lozin

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_76

zbMATH Keywords

fixed parameter tractabilityclique-widthtree-widthunit interval graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75)

Related Items (2)

Compact labelings for efficient first-order model-checking ⋮ Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width

This page was built for publication: From Tree-Width to Clique-Width: Excluding a Unit Interval Graph