scientific article; zbMATH DE number 5279391
From MaRDI portal
Publication:5387696
zbMath1153.05037MaRDI QIDQ5387696
Jan Kára, Jan Kratochvíl, David R. Wood
Publication date: 27 May 2008
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85/showToc.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (10)
Brushing with additional cleaning restrictions ⋮ \textsc{polish} -- Let us play the cleaning game ⋮ Fast-mixed searching and related problems on graphs ⋮ Fast edge searching and fast searching on graphs ⋮ Imbalance is fixed parameter tractable ⋮ Cleaning with brooms ⋮ Clean the graph before you draw it! ⋮ Imbalance parameterized by twin cover revisited ⋮ On the Complexity of Planar Covering of Small Graphs ⋮ The distance orientation problem
This page was built for publication:
