Vertex Exponential Algorithms for Connected f-Factors

DOI10.4230/LIPICS.FSTTCS.2014.61MaRDI QIDQ2978502zbMATH OpenOpenAlexFDO

Authors Geevarghese Philip, M. S. Ramanujan

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2014.61

zbMATH Keywords

\(f\)-factorsexact exponential time algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximation and exact algorithms for special cases of connected f-factors
• Approximation algorithms for k-connected graph factors
• Theoretical Computer Science
• On the complexity landscape of connected \(f\)-factor problems
• On the complexity landscape of connected \(f\)-factor problems
• Approximation algorithms for connected graph factors of minimum weight
• A note on Winkler's algorithm for factoring a connected graph
• Connected factors in graphs -- a survey
• Exact algorithms for the vertex separator problem in graphs
• FPT algorithms for connected feedback vertex set

Cited in

(3)

• On the complexity landscape of connected \(f\)-factor problems
• Approximation and exact algorithms for special cases of connected f-factors
• On the complexity landscape of connected \(f\)-factor problems

This page was built for publication: Vertex Exponential Algorithms for Connected f-Factors

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