An O(VE) algorithm for ear decompositions of matching-covered graphs

Authors:
Marcelo H. de Carvalho;Joseph Cheriyan
Affiliations:
University of Waterloo, Ontario, Canada;University of Waterloo, Ontario, Canada
Venue:
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2005

Citing 7
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Matching structure and the matching lattice

Journal of Combinatorial Theory Series B
Maximum matchings in general graphs through randomization

Journal of Algorithms
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Randomized $\tilde{O}(M(|V|))$ Algorithms for Problems in Matching Theory

SIAM Journal on Computing
The two ear theorem on matching-covered graphs

Journal of Combinatorial Theory Series B
Maximum skew-symmetric flows and matchings

Mathematical Programming: Series A and B

Finding all maximally-matchable edges in a bipartite graph

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Our main result is an O(nm)-time (deterministic) algorithm for constructing an ear decomposition of a matching-covered graph, improving on the previous best running time of O(nm2). where n and m denote the number of nodes and edges. The improvement in the running time comes from new structural results that give a sharpened version of Lovász and Plummer's Two-ear Theorem. Our algorithm is based on O(nm)-time algorithms for two other fundamental problems in matching theory, namely, finding all the allowed edges of a graph, and finding the canonical partition of an elementary graph. (To the best of our knowledge, no faster deterministic algorithms are known for these two fundamental problems.)