Enumerating Minimal Subset Feedback Vertex Sets

DOI10.1007/978-3-642-22300-6_34zbMath1342.68162OpenAlexW1519004817WikidataQ60488559 ScholiaQ60488559MaRDI QIDQ5199260

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

Publication date: 12 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22300-6_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ Subset feedback vertex sets in chordal graphs ⋮ Enumerating minimal subset feedback vertex sets ⋮ On the number of minimal dominating sets on some graph classes

This page was built for publication: Enumerating Minimal Subset Feedback Vertex Sets