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

DOI10.1145/1103963.1103969zbMath1321.05200OpenAlexW2170132163MaRDI QIDQ2944500

Marcelo H. De Carvalho, Joseph Cheriyan

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1103963.1103969

zbMATH Keywords

matching theoryear decompositions

Mathematics Subject Classification ID

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

Related Items (4)

Even cycles and perfect matchings in claw-free plane graphs ⋮ Ear decomposition and induced even cycles ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation

This page was built for publication: An O ( VE ) algorithm for ear decompositions of matching-covered graphs