The price of connectivity for feedback vertex set

zbMATH Open1293.05185MaRDI QIDQ5419953FDOQ5419953

Authors: Rémy Belmonte, Pim Van 't Hof, Marcin Kamiński, Daniël Paulusma 

Publication date: 11 June 2014

Recommendations

• The price of connectivity for feedback vertex set
• Forbidden induced subgraphs and the price of connectivity for feedback vertex set
• FPT algorithms for connected feedback vertex set
• scientific article; zbMATH DE number 7378380
• FPT algorithms for connected feedback vertex set

zbMATH Keywords

minimum feedback vertex setconnected \(H\)-free graphminimum connected feedback vertex set

Mathematics Subject Classification ID

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

Cited In (9)

• Cost of sequential connection for points in space
• Forbidden induced subgraphs and the price of connectivity for feedback vertex set
• The price of connectivity for dominating set: upper bounds and complexity
• The price of connectivity for cycle transversals
• On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
• Title not available (Why is that?)
• The price of connectivity for feedback vertex set
• The price of connectivity for cycle transversals

This page was built for publication: The price of connectivity for feedback vertex set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419953)