Article

Free access

Unique maximum matching algorithms

Authors:

Harold N. Gabow,

Haim Kaplan,

Robert E. TarjanAuthors Info & Claims

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

Pages 70 - 78

https://doi.org/10.1145/301250.301273

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

M.O. Ball and U. Derigs. An analysis of alternative strategies for implementing matching algorithms. Networks, 13:517-549, 1983,

Crossref

Google Scholar

[2]

T. C. Biedl, P. Bose, E. D. Demaine, and A. Lubiw. Efficient algorithms for Petersen's matching theorem. In Proc. lOth Annual A CM-SIAM Syrup. on Discrete Algorithms, pages 130-139, 1999.

Digital Library

Google Scholar

[3]

R.B. Carey and G.D. Stormo. Graph-theoretic approach to RNA modeling using comparative data. In Proceedings 3rd International Conf. on Intelligent Systems for Molecular Biology, pages 75-80, t995.

Google Scholar

[4]

J. Edmonds. Maximum matching and a polyhedron with 0,l-vertices. J. Res. Nat. Bur. Standards, 69B: I25-130, 1965.

Google Scholar

[5]

J. Edmonds. Paths, trees, and flowers. Canadian d. Math, pages 233-240, 1965.

Google Scholar

[6]

H. N. Gabow. Algorithmic proofs of two relations between connectivity and the l-factors of a graph. Discrete Math, 26:33-40, 1979.

Crossref

Google Scholar

[7]

tt. N. Gabow. An efiqcient reduction tec_lmique for degree-constrained subgraph and bidirected network flow problems. In Proc. I5th Annual A CM Syrup. on Theory o} Comp., pages 448-456, 1983.

Digital Library

Google Scholar

[8]

H. N. Gabow and R. E. Tarjan. A linear time al~ gorithm for a special case of disjoint set union. J. Computer and System Sciences, 30:209-221, 1985.

Crossref

Google Scholar

[9]

H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graph matching problems. J. Assoc. Comput. Mach., 38:815-853, 1991.

Digital Library

Google Scholar

[10]

H.N. Oabow. A scaling algorithm for weighted matching on general graphs. In Proc. 261h Annual Syrup. on Found. of Comp. Sci., pages 90-100, 1985.

Google Scholar

[11]

H.N. Gabow. Data structures for weighted matching and nearest common ancestors with linking. In Proc. 1st Annual A CM-SIAM Syrup. on Disc. Algorithms, pages 434-443, 1990.

Digital Library

Google Scholar

[12]

M. C. Golumbic, T. Hirst, and M. Lewenstein. Uniquely restricted matchings, manuscript, 1998.

Google Scholar

[13]

J. ltotm, K, de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. 30th Annual A CM Syrup. on Theory of Comp., pages 79-89, 1998.

Digital Library

Google Scholar

[14]

A. Kotzig. On the theory of finite graphs with a linear factor I. Mat.-Fyz. ~asopis Slovensk. Akad. Vied, 9:73-91, 1959.

Google Scholar

[15]

E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart and Winston, New York, 1976.

Google Scholar

[16]

L. Lov&sz and M.D. Plummet. Matching Theory. North-Holland, Amsterdam, 1986.

Google Scholar

[17]

i.E. Tabaska, R.B. Gary, H.N. Gabow, and G.D. Stormo. An RNA folding method capable of identifying pseudoknots and base triples. Bioinformatics, 14($):691~99, m9S.

Google Scholar

[18]

R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Computing, 1:146--160, 1972.

Digital Library

Google Scholar

[19]

R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, 1982.

Digital Library

Google Scholar

[20]

R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. Assoc. Comput. Mach., 31:245-281, 1984.

Digital Library

Google Scholar

[21]

M. Thorup. Private communication, 1998.

Google Scholar

[22]

M. Thorup. Decremental dynamic connectivity. In Proc. 8th Annual A CM-SIAM Syrap. on Discrete Algorithms, pages 305-313, 1997.

Digital Library

Google Scholar

Cited By

View all

Liu MWang YLi S(2023)A Field Programmable Gate Array Placement Methodology for Netlist-Level Circuits with GPU AccelerationElectronics10.3390/electronics1301003713:1(37)Online publication date: 20-Dec-2023
https://doi.org/10.3390/electronics13010037
Plummer M(2013)Factors and FactorizationHandbook of Graph Theory, Second Edition10.1201/b16132-32(490-529)Online publication date: 26-Nov-2013
https://doi.org/10.1201/b16132-32
Ferdowsi VMitchell K(2011)A distributed collision-free time slot and channel assignment algorithm for OFDM/TDMA wireless relay networks2011 Wireless Telecommunications Symposium (WTS)10.1109/WTS.2011.5960866(1-6)Online publication date: Apr-2011
https://doi.org/10.1109/WTS.2011.5960866
Show More Cited By

Index Terms

Unique maximum matching algorithms
1. Mathematics of computing
  1. Discrete mathematics
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching
  2. Randomness, geometry and discrete structures

Recommendations

Unique Maximum Matching Algorithms

We consider the problem of testing the uniqueness of maximum matchings, both in the unweighted and in the weighted case. For the unweighted case, we have two results. First, given a graph with n vertices and m edges, we can test whether the graph has a ...
Reducing rank-maximal to maximum weight matching

Given a bipartite graph G(V,E), V=A@?@?B where |V|=n,|E|=m and a partition of the edge set into r@?m disjoint subsets E=E"1@?@?E"2@?@?...@?@?E"r, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M@?E"1| ...
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius
Abstract
The (Perfect) Matching Cut problem is to decide if a graph G has a (perfect) matching cut, i.e., a (perfect) matching that is also an edge cut of G. Both Matching Cut and Perfect Matching Cut are known to be NP-complete. A perfect matching cut is ...

Comments

Information & Contributors

Information

Published In

STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of Computing

May 1999

790 pages

ISBN:1581130678

DOI:10.1145/301250

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC99

Sponsor:

SIGACT

STOC99: ACM Symposium on Theory of Computing

May 1 - 4, 1999

Georgia, Atlanta, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
1,296
Total Downloads

Downloads (Last 12 months)118
Downloads (Last 6 weeks)5

Reflects downloads up to 26 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu MWang YLi S(2023)A Field Programmable Gate Array Placement Methodology for Netlist-Level Circuits with GPU AccelerationElectronics10.3390/electronics1301003713:1(37)Online publication date: 20-Dec-2023
https://doi.org/10.3390/electronics13010037
Plummer M(2013)Factors and FactorizationHandbook of Graph Theory, Second Edition10.1201/b16132-32(490-529)Online publication date: 26-Nov-2013
https://doi.org/10.1201/b16132-32
Ferdowsi VMitchell K(2011)A distributed collision-free time slot and channel assignment algorithm for OFDM/TDMA wireless relay networks2011 Wireless Telecommunications Symposium (WTS)10.1109/WTS.2011.5960866(1-6)Online publication date: Apr-2011
https://doi.org/10.1109/WTS.2011.5960866
Nagarajan NPop M(2009)Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation SequencingJournal of Computational Biology10.1089/cmb.2009.000516:7(897-908)Online publication date: Jul-2009
https://doi.org/10.1089/cmb.2009.0005
Kowaluk MLingas A(2007)Unique lowest common ancestors in dags are almost as easy as matrix multiplicationProceedings of the 15th annual European conference on Algorithms10.5555/1778580.1778607(265-274)Online publication date: 8-Oct-2007
https://dl.acm.org/doi/10.5555/1778580.1778607
Plummer M(2007)PerspectivesDiscrete Mathematics10.1016/j.disc.2005.11.059307:7-8(791-821)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1016/j.disc.2005.11.059
Kowaluk MLingas A(2007)Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix MultiplicationAlgorithms – ESA 200710.1007/978-3-540-75520-3_25(265-274)Online publication date: 2007
https://doi.org/10.1007/978-3-540-75520-3_25
Hoang TMahajan MThierauf T(2006)On the bipartite unique perfect matching problemProceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I10.1007/11786986_40(453-464)Online publication date: 10-Jul-2006
https://dl.acm.org/doi/10.1007/11786986_40
Babenko M(2006)Acyclic bidirected and skew-symmetric graphsProceedings of the First international computer science conference on Theory and Applications10.1007/11753728_6(23-34)Online publication date: 8-Jun-2006
https://dl.acm.org/doi/10.1007/11753728_6
Thorup MKarger D(2002)Dynamic Graph Algorithms with ApplicationsAlgorithm Theory - SWAT 200010.1007/3-540-44985-X_1(1-9)Online publication date: 15-Mar-2002
https://doi.org/10.1007/3-540-44985-X_1
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations