Enumerating minimal subset feedback vertex sets

DOI10.1007/s00453-012-9731-6zbMath1303.05189WikidataQ60488401 ScholiaQ60488401MaRDI QIDQ472481

Dieter Kratsch, Fedor V. Fomin, Pinar Heggernes, Charis Papadopoulos, Yngve Villanger

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-012-9731-6

zbMATH Keywords

NP-hard problems; exact exponential algorithms; subset feedback vertex set

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C30: Enumeration in graph theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)