An algorithm for computing simple k-factors

Authors:
Henk Meijer;Yurai Núòez-Rodríguez;David Rappaport
Affiliations:
Roosevelt Academy, NL-4330 AB Middelburg, The Netherlands;School of Computing, Queen's University, Kingston, ON, Canada, K7L 3N6;School of Computing, Queen's University, Kingston, ON, Canada, K7L 3N6
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 0

Faster shortest-path algorithms for planar graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Near-optimal fully-dynamic graph connectivity

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Efficient algorithms for Petersen's matching theorem

Journal of Algorithms
Hamiltonian Cycles in Solid Grid Graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Maximum Matchings via Gaussian Elimination

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Maximum matchings in planar graphs via gaussian elimination

Algorithmica
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

A k-factor of graph G is defined as a k-regular spanning subgraph of G. For instance, a 2-factor of G is a set of cycles that span G. 2-factors have multiple applications in Graph Theory, Computer Graphics, and Computational Geometry. We define a simple 2-factor as a 2-factor without degenerate cycles. In general, simple k-factors are defined as k-regular spanning subgraphs where no edge is used more than once. We propose a new algorithm for computing simple k-factors for all values of k=2.