Vertex Exponential Algorithms for Connected f-Factors

DOI10.4230/LIPIcs.FSTTCS.2014.61zbMath1360.68517OpenAlexW1589502830MaRDI QIDQ2978502

M. S. Ramanujan, Geevarghese Philip

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

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

Related Items (1)

On the complexity landscape of connected \(f\)-factor problems

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