scientific article; zbMATH DE number 1929955
From MaRDI portal
Publication:4708588
zbMath1014.68218MaRDI QIDQ4708588
Ljubomir Perković, Iyad A. Kanj
Publication date: 18 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200399.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
Genus characterizes the complexity of certain graph problems: Some tight results ⋮ Unnamed Item ⋮ Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems ⋮ A strengthened analysis of an algorithm for dominating set in planar graphs ⋮ Subexponential parameterized algorithms ⋮ Confronting intractability via parameters ⋮ Computational study on a PTAS for planar dominating set problem ⋮ Linearity of grid minors in treewidth with applications through bidimensionality ⋮ Kernels in planar digraphs ⋮ New upper bounds on the decomposability of planar graphs ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ On parameterized exponential time complexity ⋮ Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor ⋮ Computational study on planar dominating set problem ⋮ Linear time algorithms for finding a dominating set of fixed size in degenerated graphs ⋮ Parameterized computation and complexity: a new approach dealing with NP-hardness
This page was built for publication:
