Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
From MaRDI portal
Publication:1709594
DOI10.1007/s00453-017-0289-1zbMath1383.05162arXiv1509.03753MaRDI QIDQ1709594
Dieter Kratsch, Petr A. Golovach, Pinar Heggernes, Sigve Hortemo Sæther, Yngve Villanger, Mamadou Moustapha Kanté
Publication date: 6 April 2018
Published in: Algorithmica, Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.03753
linear delay; domination problem; local linear MIM-width; output-polynomial enumeration; linear maximum induced matching width of a graph; LMIM-width
05C31: Graph polynomials
05C30: Enumeration in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)