Efficient Algorithms for Petersen's Matching Theorem
From MaRDI portal
Publication:2709795
DOI10.1006/jagm.2000.1132zbMath0969.68179OpenAlexW2137498124WikidataQ56689780 ScholiaQ56689780MaRDI QIDQ2709795
Prosenjit Bose, Anna Lubiw, Erik D. Demaine, Therese C. Biedl
Publication date: 17 April 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1132
Related Items
Tight bounds on maximal and maximum matchings, The cost of perfection for matchings in graphs, Positive planar satisfiability problems under 3-connectivity constraints, Graph factors and factorization: 1985--2003: a survey, Relating planar graph drawings to planar satisfiability problems, Arc diagrams, flip distances, and Hamiltonian triangulations, Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces, Breakpoint distance and PQ-trees, COLORING ALGORITHMS ON SUBCUBIC GRAPHS, Deciding Relaxed Two-Colourability: A Hardness Jump, Computing large matchings in planar graphs with fixed minimum degree, An algorithm for computing simple \(k\)-factors, Planar bus graphs
