Skip header Section
Skip Bibliometrics Section
Matching Theory (North-Holland mathematics studies)August 1986
- Author:
- L. Lovasz
Abstract
No abstract available.
Cited By
- Ferhat D, Király Z, Sebő A and Stauffer G (2024). How many matchings cover the nodes of a graph?, Mathematical Programming: Series A and B, 203:1-2, (271-284), Online publication date: 1-Jan-2024.
- Gabow H (2023). A Weight-Scaling Algorithm for f-Factors of Multigraphs, Algorithmica, 85:10, (3214-3289), Online publication date: 1-Oct-2023.
- Gabow H (2023). Blocking Trails for f-factors of Multigraphs, Algorithmica, 85:10, (3168-3213), Online publication date: 1-Oct-2023.
- Guo B, Karaca O, Azhdari S, Kamgarpour M and Ferrari-Trecate G Actuator Placement for Structural Controllability beyond Strong Connectivity and towards Robustness 2021 60th IEEE Conference on Decision and Control (CDC), (5294-5299)
- Amaral M, Polo J, Carrera D, Gonzalez N, Yang C, Morari A, D’Amora B, Youssef A and Steinder M (2021). DRMaestro: orchestrating disaggregated resources on virtualized data-centers, Journal of Cloud Computing: Advances, Systems and Applications, 10:1, Online publication date: 6-Mar-2021.
- Gómez R and Wakabayashi Y (2019). Nontrivial path covers of graphs: existence, minimization and maximization, Journal of Combinatorial Optimization, 39:2, (437-456), Online publication date: 1-Feb-2020.
Fenner S, Gurjar R and Thierauf T (2019). A deterministic parallel algorithm for bipartite perfect matching, Communications of the ACM, 62:3, (109-115), Online publication date: 21-Feb-2019.- Esfandiari H, Hajiaghayi M, Liaghat V, Monemizadeh M and Onak K (2018). Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond, ACM Transactions on Algorithms, 14:4, (1-23), Online publication date: 31-Oct-2018.
- Gómez R and Wakabayashi Y Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization Graph-Theoretic Concepts in Computer Science, (228-238)
- Narayanaswamy N, Nasre M and Vijayaragunathan R Facility Location on Planar Graphs with Unreliable Links Computer Science – Theory and Applications, (269-281)
- Ye D (2018). Maximum matchings in regular graphs, Discrete Mathematics, 341:5, (1195-1198), Online publication date: 1-May-2018.
- Nicodemos D and Stehlk M (2018). Packing and covering odd cycles in cubic plane graphs with small faces, European Journal of Combinatorics, 67:C, (208-221), Online publication date: 1-Jan-2018.
- Munaro A (2017). Boundary classes for graph problems involving non-local properties, Theoretical Computer Science, 692:C, (46-71), Online publication date: 5-Sep-2017.
- Čepek O, Gursky Š and Kučera P On minimum representations of matched formulas Proceedings of the 26th International Joint Conference on Artificial Intelligence, (4980-4984)
- Iwata S and Kobayashi Y A weighted linear matroid parity algorithm Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (264-276)
- Li H and Zhang Z (2017). Maximum matchings in scale-free networks with identical degree distribution, Theoretical Computer Science, 675:C, (64-81), Online publication date: 2-May-2017.
- Aldred R and Plummer M (2017). Matching extension in prism graphs, Discrete Applied Mathematics, 221:C, (25-32), Online publication date: 20-Apr-2017.
- Gutin G, Sheng B and Wahlström M (2017). Odd properly colored cycles in edge-colored graphs, Discrete Mathematics, 340:4, (817-821), Online publication date: 1-Apr-2017.
- Kern W and Manthey B (2017). Approximating bounded-degree spanning trees and connected factors withleaves, Operations Research Letters, 45:2, (115-118), Online publication date: 1-Mar-2017.
- Zhang W, Tan M, Sheng Q, Yao L and Shi Q Efficient Orthogonal Non-negative Matrix Factorization over Stiefel Manifold Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, (1743-1752)
- Dabrowski K, Lozin V, Werra D and Zamaraev V (2016). Combinatorics and Algorithms for Augmenting Graphs, Graphs and Combinatorics, 32:4, (1339-1352), Online publication date: 1-Jul-2016.
- Fenner S, Gurjar R and Thierauf T Bipartite perfect matching is in quasi-NC Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (754-763)
- Matsiy O, Morozov A and Panishev A (2016). Fast Algorithm to Find 2-Factor of Minimum Weight, Cybernetics and Systems Analysis, 52:3, (467-474), Online publication date: 1-May-2016.
- Chebolu S, Lockridge K and Yamskulna G (2015). Characterizations of Mersenne and 2-rooted primes, Finite Fields and Their Applications, 35:C, (330-351), Online publication date: 1-Sep-2015.
- Razaflndrazaka F, Reitebuch U and Polthier K Perfect matching quad layouts for manifold meshes Proceedings of the Eurographics Symposium on Geometry Processing, (219-228)
- Antikacioglu A, Ravi R and Sridhar S Recommendation Subgraphs for Web Discovery Proceedings of the 24th International Conference on World Wide Web, (77-87)
- Esfandiari H, Hajiaghayi M, Liaghat V, Monemizadeh M and Onak K Streaming algorithms for estimating the matching size in planar graphs and beyond Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, (1217-1233)
- Khare N, Mehta N and Puliyambalath N (2015). Generalization of Erdős-Gallai edge bound, European Journal of Combinatorics, 43:C, (124-130), Online publication date: 1-Jan-2015.
- Zhao M, Jin X, Zhang Z and Li B (2014). Fault diagnosis of rolling element bearings via discriminative subspace learning, Expert Systems with Applications: An International Journal, 41:7, (3391-3401), Online publication date: 1-Jun-2014.
- Mazzuoccolo G (2014). On the excessive [m]-index of a tree, Discrete Applied Mathematics, 162, (264-270), Online publication date: 1-Jan-2014.
- Park B, Kim S and Kim H (2013). On the cores of games arising from integer edge covering functions of graphs, Journal of Combinatorial Optimization, 26:4, (786-798), Online publication date: 1-Nov-2013.
- Ye J and Jin Z (2013). Non‐negative matrix factorisation based on fuzzy K nearest neighbour graph and its applications, IET Computer Vision, 7:5, (346-353), Online publication date: 1-Oct-2013.
- Van Zuylen A (2013). Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems, Discrete Applied Mathematics, 161:13-14, (2142-2157), Online publication date: 1-Sep-2013.
- Kaya K, Langguth J, Manne F and UçAr B (2013). Push-relabel based algorithms for the maximum transversal problem, Computers and Operations Research, 40:5, (1266-1275), Online publication date: 1-May-2013.
- Chang J, Gabow H and Khuller S A model for minimizing active processor time Proceedings of the 20th Annual European conference on Algorithms, (289-300)
- Aziz H (2012). Review of matching theory, by László Lovász and Michael D. Plummer, ACM SIGACT News, 43:3, (38-40), Online publication date: 27-Aug-2012.
- Gurjar R, Korwar A, Messner J, Straub S and Thierauf T Planarizing gadgets for perfect matching do not exist Proceedings of the 37th international conference on Mathematical Foundations of Computer Science, (478-490)
- Lacroix M, Mahjoub A and Martin S Polyhedral analysis and branch-and-cut for the structural analysis problem Proceedings of the Second international conference on Combinatorial Optimization, (117-128)
- Duff I, Kaya K and Uçcar B (2012). Design, implementation, and analysis of maximum transversal algorithms, ACM Transactions on Mathematical Software, 38:2, (1-31), Online publication date: 1-Dec-2011.
- Azad A, Halappanavar M, Dobrian F and Pothen A Computing maximum matching in parallel on bipartite graphs Proceedings of the 1st Workshop on Irregular Applications: Architectures and Algorithms, (11-14)
- Raman V, Ramanujan M and Saurabh S Paths, flowers and vertex cover Proceedings of the 19th European conference on Algorithms, (382-393)
- Hoffmann M, Sharir M, Sheffer A, Tóth C and Welzl E Counting plane graphs Proceedings of the 12th international conference on Algorithms and data structures, (524-535)
- Biedl T, Durocher S and Snoeyink J (2011). Reconstructing polygons from scanner data, Theoretical Computer Science, 412:32, (4161-4172), Online publication date: 1-Jul-2011.
- Ali N, Krishnamoorthy S, Halappanavar M and Daily J Tolerating correlated failures for generalized Cartesian distributions via bipartite matching Proceedings of the 8th ACM International Conference on Computing Frontiers, (1-10)
- Nikolopoulos S, Palios L and Papadopoulos C Counting spanning trees in graphs using modular decomposition Proceedings of the 5th international conference on WALCOM: algorithms and computation, (202-213)
- Dean B, Hedetniemi S, Hedetniemi S, Lewis J and McRae A (2011). Matchability and k-maximal matchings, Discrete Applied Mathematics, 159:1, (15-22), Online publication date: 1-Jan-2011.
- Zhang L, Chen C, Bu J, Chen Z, Tan S and He X Discriminative codeword selection for image representation Proceedings of the 18th ACM international conference on Multimedia, (173-182)
- van Zuylen A Multiplying pessimistic estimators Proceedings of the 16th annual international conference on Computing and combinatorics, (60-69)
- Li Z, Wu X and Peng H (2010). Nonnegative Matrix Factorization on Orthogonal Subspace, Pattern Recognition Letters, 31:9, (905-911), Online publication date: 1-Jul-2010.
- Cui T, Chen L and Ho T (2010). On distributed scheduling in wireless networks exploiting broadcast and network coding, IEEE Transactions on Communications, 58:4, (1223-1234), Online publication date: 1-Apr-2010.
- Franke R, Rutter I and Wagner D Computing Large Matchings in Planar Graphs with Fixed Minimum Degree Proceedings of the 20th International Symposium on Algorithms and Computation, (872-881)
- Biedl T, Durocher S and Snoeyink J Reconstructing Polygons from Scanner Data Proceedings of the 20th International Symposium on Algorithms and Computation, (862-871)
- Bai B, Chen W, Cao Z and Letaief K Diversity-multiplexing tradeoff in OFDMA systems with coherence bandwidth splitting Proceedings of the 28th IEEE conference on Global telecommunications, (3688-3693)
- Tosun A (2009). Divide-and-conquer scheme for strictly optimal retrieval of range queries, ACM Transactions on Storage, 5:3, (1-32), Online publication date: 1-Nov-2009.
- Cariolaro D and Hilton A (2009). An application of Tutte's Theorem to 1-factorization of regular graphs of high degree, Discrete Mathematics, 309:14, (4736-4745), Online publication date: 1-Jul-2009.
- Bai B, Chen W, Cao Z and Letaief K Optimal diversity-multiplexing tradeoff in OFDMA systems Proceedings of the 2009 IEEE international conference on Communications, (3988-3992)
- Cai D, Wang X and He X Probabilistic dyadic data analysis with local and global consistency Proceedings of the 26th Annual International Conference on Machine Learning, (105-112)
- Takács B and Demiris Y Multi-robot plan adaptation by constrained minimal distortion feature mapping Proceedings of the 2009 IEEE international conference on Robotics and Automation, (3301-3308)
- Manthey B (2009). Minimum-weight cycle covers and their approximability, Discrete Applied Mathematics, 157:7, (1470-1480), Online publication date: 1-Apr-2009.
- Cioabă S, Gregory D and Haemers W (2009). Matchings in regular graphs from eigenvalues, Journal of Combinatorial Theory Series B, 99:2, (287-297), Online publication date: 1-Mar-2009.
- Manthey B and Shankar Ram L (2009). Approximation Algorithms for Multi-Criteria Traveling Salesman Problems, Algorithmica, 53:1, (69-88), Online publication date: 1-Jan-2009.
- Vishwanathan S (2008). On hard instances of approximate vertex cover, ACM Transactions on Algorithms, 5:1, (1-6), Online publication date: 1-Nov-2008.
- Broersma H and Paulusma D Computing Sharp 2-Factors in Claw-Free Graphs Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science, (193-204)
- Cai D, He X and Han J Sparse projections over graph Proceedings of the 23rd national conference on Artificial intelligence - Volume 2, (610-615)
- Fritzilas E, Rios-Solis Y and Rahmann S Structural Identifiability in Low-Rank Matrix Factorization Proceedings of the 14th annual international conference on Computing and Combinatorics, (140-148)
- Alon N, Berke R, Buchin K, Buchin M, Csorba P, Shannigrahi S, Speckmann B and Zumstein P Polychromatic colorings of plane graphs Proceedings of the twenty-fourth annual symposium on Computational geometry, (338-345)
- Lotker Z, Patt-Shamir B and Pettie S Improved distributed approximate matching Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, (129-136)
- Orlin J A fast, simpler algorithm for the matroid parity problem Proceedings of the 13th international conference on Integer programming and combinatorial optimization, (240-258)
- Oriolo G, Pietropaoli U and Stauffer G A new algorithm for the maximum weighted stable set problem in claw-free graphs Proceedings of the 13th international conference on Integer programming and combinatorial optimization, (77-96)
- Kleinberg J and Tardos É Balanced outcomes in social exchange networks Proceedings of the fortieth annual ACM symposium on Theory of computing, (295-304)
- Bartha M and Krész M (2008). Splitters and barriers in open graphs having a perfect internal matching, Acta Cybernetica, 18:4, (697-718), Online publication date: 20-Jan-2008.
- Alon N and Capalbo M (2007). Sparse universal graphs for bounded-degree graphs, Random Structures & Algorithms, 31:2, (123-133), Online publication date: 1-Sep-2007.
- Chen J, Zhao Z, Ye J and Liu H Nonlinear adaptive distance metric learning for clustering Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, (123-132)
- Manthey B Minimum-weight cycle covers and their approximability Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science, (178-189)
- Bogdanowicz Z and Coleman N Sensor-target and weapon-target pairings based on auction algorithm Proceedings of the 11th WSEAS International Conference on Applied Mathematics, (92-96)
- Monnot J and Toulouse S The Pk Partition Problem and Related Problems in Bipartite Graphs Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (422-433)
- Cohen-Steiner D, Edelsbrunner H and Harer J (2007). Stability of Persistence Diagrams, Discrete & Computational Geometry, 37:1, (103-120), Online publication date: 1-Jan-2007.
- Makowsky J From a zoo to a zoology Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers, (330-341)
- Babenko M Acyclic bidirected and skew-symmetric graphs Proceedings of the First international computer science conference on Theory and Applications, (23-34)
- Kulkarni R A new NC-algorithm for finding a perfect matching in d-regular bipartite graphs when d is small Proceedings of the 6th Italian conference on Algorithms and Complexity, (308-319)
- De Marco G, Leoncini M and Montangero M Distributed algorithm for a color assignment on asynchronous rings Proceedings of the 20th international conference on Parallel and distributed processing, (44-44)
- Cui Y, Wang L and Zhu D A 1.75-approximation algorithm for unsigned translocation distance Proceedings of the 16th international conference on Algorithms and Computation, (392-401)
- Elbassioni K, Katriel I, Kutz M and Mahajan M Simultaneous matchings Proceedings of the 16th international conference on Algorithms and Computation, (106-115)
- Cai D, He X and Han J (2005). Document Clustering Using Locality Preserving Indexing, IEEE Transactions on Knowledge and Data Engineering, 17:12, (1624-1637), Online publication date: 1-Dec-2005.
- He X, Cai D and Min W Statistical and computational analysis of locality preserving projection Proceedings of the 22nd international conference on Machine learning, (281-288)
- Foufou S, Michelucci D and Jurzak J Numerical decomposition of geometric constraints Proceedings of the 2005 ACM symposium on Solid and physical modeling, (143-151)
- Eisenbrand F, Oriolo G, Stauffer G and Ventura P Circular ones matrices and the stable set polytope of quasi-line graphs Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization, (291-305)
- Mahajan M, Subramanya P and Vinay V (2004). The combinatorial approach yields an NC algorithm for computing Pfaffians, Discrete Applied Mathematics, 143:1-3, (1-16), Online publication date: 30-Sep-2004.
- Wu W, Yu C, Doan A and Meng W An interactive clustering-based approach to integrating source query interfaces on the deep Web Proceedings of the 2004 ACM SIGMOD international conference on Management of data, (95-106)
- Brown J, Hickman C and Nowakowski R (2004). On the Location of Roots of Independence Polynomials, Journal of Algebraic Combinatorics: An International Journal, 19:3, (273-282), Online publication date: 1-May-2004.
- Ganapathy G, Ramachandran V and Warnow T On contract-and-refine transformations between phylogenetic trees Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (900-909)
- Szeider S Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable Proceedings of the 9th annual international conference on Computing and combinatorics, (548-558)
- Gaur D and Krishnamurti R Scheduling intervals using independent sets in claw-free graphs Proceedings of the 2003 international conference on Computational science and its applications: PartI, (254-262)
- Cunningham W (2002). Matching, matroids, and extensions, Mathematical Programming: Series A and B, 91:3, (515-542), Online publication date: 1-Feb-2002.
- Mulmuley K and Shah P (2001). A Lower Bound for the Shortest Path Problem, Journal of Computer and System Sciences, 63:2, (253-267), Online publication date: 1-Sep-2001.
- Gupta A, Kleinberg J, Kumar A, Rastogi R and Yener B Provisioning a virtual private network Proceedings of the thirty-third annual ACM symposium on Theory of computing, (389-398)
- Nisan N Bidding and allocation in combinatorial auctions Proceedings of the 2nd ACM conference on Electronic commerce, (1-12)
- Istrail S Statistical mechanics, three-dimensionality and NP-completeness Proceedings of the thirty-second annual ACM symposium on Theory of computing, (87-96)
- Agbaria A, Ben-Asher Y and Newman I Communication-processor tradeoffs in limited resources PRAM Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, (74-82)
- Preis R Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs Proceedings of the 16th annual conference on Theoretical aspects of computer science, (259-269)
- Biedl T, Bose P, Demaine E and Lubiw A Efficient algorithms for Petersen's matching theorem Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (130-139)
- Shamir R and Tsur D The maximum subforest problem Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (394-399)
- Christie D A 3/2-approximation algorithm for sorting by reversals Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (244-252)
- Efrat A and Itai A Improvements on bottleneck matching and related problems using geometry Proceedings of the twelfth annual symposium on Computational geometry, (301-310)
- RÉGIN J A filtering algorithm for constraints of difference in CSPs Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (362-367)
- ErdźS P and Székely L (1994). On weighted multiway cuts in trees, Mathematical Programming: Series A and B, 65:1-3, (93-105), Online publication date: 1-Feb-1994.
- Murota K (1993). Hierarchical decomposition of symmetric discrete systems by matroid and group theories, Mathematical Programming: Series A and B, 59:1-3, (377-404), Online publication date: 1-Mar-1993.
- Zaremba L (1991). Perfect graphs and norms, Mathematical Programming: Series A and B, 51:1-3, (269-272), Online publication date: 1-Jul-1991.
- Liu J (1989). A graph partitioning algorithm by node separators, ACM Transactions on Mathematical Software, 15:3, (198-219), Online publication date: 1-Sep-1989.
Index Terms
- Matching Theory (North-Holland mathematics studies)
Recommendations
An interview with John H. Holland
John Holland began his academic career as a graduate student at the University of Michigan studying with Arthur Burks, a designer of early programmable computers and colleague of John von Neumann. Under Burks' supervision, in 1959 Holland received what ...