Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
From MaRDI portal
Publication:3401102
DOI10.1007/978-3-642-11266-9_27zbMath1274.68671DBLPconf/sofsem/DiksS10OpenAlexW1526395573WikidataQ60781969 ScholiaQ60781969MaRDI QIDQ3401102
Piotr Stanczyk, Krzysztof Diks
Publication date: 28 January 2010
Published in: SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11266-9_27
Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (6)
The cost of perfection for matchings in graphs ⋮ A fast algorithm for computing irreducible triangulations of closed surfaces in \(\mathbb{E}^d\) ⋮ Representing graphs and hypergraphs by touching polygons in 3D ⋮ Edge $k$-$q$-Colorability of Graphs ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph
This page was built for publication: Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
