An algorithm for computing simple \(k\)-factors

DOI10.1016/j.ipl.2009.02.013zbMath1209.68380OpenAlexW2059051297MaRDI QIDQ987840

Yurai Núñez-Rodríguez, David Rappaport, Henk G. Meijer

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.013

zbMATH Keywords

graph algorithms2-factorsgraph factors\(k\)-factorssimple \(k\)-factors

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Gallai-Edmonds decomposition as a pruning technique ⋮ Construction of k-matchings in graph products ⋮ Unnamed Item ⋮ Minimum reload cost graph factors

Cites Work

• Unnamed Item
• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• The general maximum matching algorithm of Micali and Vazirani
• Maximum matchings in planar graphs via Gaussian elimination
• Efficient Algorithms for Petersen's Matching Theorem
• Near-optimal fully-dynamic graph connectivity
• Faster shortest-path algorithms for planar graphs

This page was built for publication: An algorithm for computing simple \(k\)-factors