scientific article; zbMATH DE number 2079336
From MaRDI portal
Publication:4471291
zbMath1094.68610MaRDI QIDQ4471291
Fedor V. Fomin, Dimitrios M. Thilikos
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Genus characterizes the complexity of certain graph problems: Some tight results ⋮ Experiments on data reduction for optimal domination in networks ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms ⋮ Tree decompositions of graphs: saving memory in dynamic programming ⋮ Linearity of grid minors in treewidth with applications through bidimensionality ⋮ Branchwidth of chordal graphs ⋮ Kernels in planar digraphs ⋮ Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms ⋮ New upper bounds on the decomposability of planar graphs ⋮ Linear time algorithms for finding a dominating set of fixed size in degenerated graphs ⋮ A refined search tree technique for dominating set on planar graphs ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness
This page was built for publication:
