Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs

DOI10.1145/1101821.1101823zbMath1326.05152WikidataQ56338015 ScholiaQ56338015MaRDI QIDQ3455210

Erik D. Demaine, Fedor V. Fomin, Dimitrios M. Thilikos, Mohammad Taghi Hajiaghayi

Publication date: 4 December 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1101821.1101823

zbMATH Keywords

planar graph; domination; fixed-parameter algorithms; map graph; \((k,r)\)-center

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C10: Planar graphs; geometric and topological aspects of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C83: Graph minors

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)