Publication:4708588
From MaRDI portal
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
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A strengthened analysis of an algorithm for dominating set in planar graphs, Subexponential parameterized algorithms, Confronting intractability via parameters, Linearity of grid minors in treewidth with applications through bidimensionality, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, On parameterized exponential time complexity, Computational study on planar dominating set problem, Linear time algorithms for finding a dominating set of fixed size in degenerated graphs, Kernels in planar digraphs, Parameterized computation and complexity: a new approach dealing with NP-hardness, Genus characterizes the complexity of certain graph problems: Some tight results, New upper bounds on the decomposability of planar graphs, Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor
