scientific article; zbMATH DE number 1834643

zbMath0999.68158MaRDI QIDQ4779138

Fran Rosamond, Ulrike Stege, Jochen Alber, Henning Fernau, Rolf Niedermeier, Michael R. Fellows, Hong Bing Fan

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360111

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominating setplanar graphsearch treefixed parameter algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Graph separators: A parameterized view ⋮ Improved exact algorithms for MAX-SAT ⋮ Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ⋮ An efficient fixed-parameter algorithm for 3-hitting set ⋮ Subexponential parameterized algorithms ⋮ Kernels in planar digraphs ⋮ Computational study on planar dominating set problem

This page was built for publication: