Lower bounds for protrusion replacement by counting equivalence classes

DOI10.1016/j.dam.2019.02.024zbMath1437.05224MaRDI QIDQ2174552

Bart M. P. Jansen, Jules Wulms

Publication date: 21 April 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/6927/

zbMATH Keywords

independent set; equivalence classes; finite integer index; boundaried graphs; protrusions

Mathematics Subject Classification ID

90C39: Dynamic programming

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

05C85: Graph algorithms (graph-theoretic aspects)

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