Article
Maximum matching in a convex bipartite graph
Abstract
A special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects ai and bj if they satisfy a local optirnality criterion based on a ranking of currently unmatched objects. When no ai and bi remain that can be matched, the largest number of acceptable matches has been found.
Citing Literature
Number of times cited according to CrossRef: 109
- Paul R. Rosenbaum, Modern Algorithms for Matching in Observational Studies, Annual Review of Statistics and Its Application, 10.1146/annurev-statistics-031219-041058, 7, 1, (143-176), (2020).
- Marco A. Stefanes, Diego P. Rubert, José Soares, Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs, Theoretical Computer Science, 10.1016/j.tcs.2019.10.042, (2019).
- Guillaume Ducoffe, A short note on the complexity of computing strong pathbreadth, Information Processing Letters, 10.1016/j.ipl.2018.01.005, 133, (56-58), (2018).
- Camila Zanette, Caitlin C. Bannan, Christopher I. Bayly, Josh Fass, Michael K. Gilson, Michael R. Shirts, John D. Chodera, David L. Mobley, Toward Learned Chemical Perception of Force Field Typing Rules, Journal of Chemical Theory and Computation, 10.1021/acs.jctc.8b00821, (2018).
- J. N. Hooker, W.-J. van Hoeve, Constraint programming and operations research, Constraints, 10.1007/s10601-017-9280-3, 23, 2, (172-195), (2017).
- Min-Sheng Lin, Chien-Min Chen, Counting independent sets in tree convex bipartite graphs, Discrete Applied Mathematics, 10.1016/j.dam.2016.08.017, 218, (113-122), (2017).
- Hao Chen, Tian Liu, Maximum Edge Bicliques in Tree Convex Bipartite Graphs, Frontiers in Algorithmics, 10.1007/978-3-319-59605-1_5, (47-55), (2017).
- Tian Wang, Zhen Peng, Wenzheng Xu, Junbin Liang, Guojun Wang, Hui Tian, Yiqiao Cai, Yonghong Chen, Cascading Target Tracking Control in Wireless Camera Sensor and Actuator Networks, Asian Journal of Control, 10.1002/asjc.1525, 19, 4, (1350-1364), (2017).
- Martin Dyer, Mark Jerrum, Haiko Müller, On the Switch Markov Chain for Perfect Matchings, Journal of the ACM, 10.1145/2822322, 64, 2, (1-33), (2017).
- A Ghoniem, H D Sherali, Set partitioning and packing versus assignment formulations for subassembly matching problems, Journal of the Operational Research Society, 10.1057/jors.2010.165, 62, 11, (2023-2033), (2017).
- Simone Bova, Friedrich Slivovsky, On Compiling Structured CNFs to OBDDs, Theory of Computing Systems, 10.1007/s00224-016-9715-z, 61, 2, (637-655), (2016).
- Irina Mustaţă, Kousuke Nishikawa, Asahi Takaoka, Satoshi Tayu, Shuichi Ueno, On orthogonal ray trees, Discrete Applied Mathematics, 10.1016/j.dam.2015.07.034, 201, (201-212), (2016).
- Liping Cheng, Fong-Yuen Ding, Modifying Mixed-Model Assembly Line Sequencing Methods to Consider Weighted Variations for Just-In-Time Production Systems, IIE Transactions, 10.1080/15458830.1996.11770745, 28, 11, (919-927), (2016).
- Hao Chen, Zihan Lei, Tian Liu, Ziyang Tang, Chaoyi Wang, Ke Xu, Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs, Journal of Combinatorial Optimization, 10.1007/s10878-015-9917-3, 32, 1, (95-110), (2015).
- Quan Zu, Miaomiao Zhang, Bin Yu, Dynamic matchings in left vertex weighted convex bipartite graphs, Journal of Combinatorial Optimization, 10.1007/s10878-015-9890-x, 32, 1, (25-50), (2015).
- Danny Z. Chen, Xiaomin Liu, Haitao Wang, Computing maximum non-crossing matching in convex bipartite graphs, Discrete Applied Mathematics, 10.1016/j.dam.2015.02.014, 187, (50-60), (2015).
- Elena Suvorova, Nadezhda Matveeva, Lev Kurbanov, undefined, 2015 Artificial Intelligence and Natural Language and Information Extraction, Social Media and Web Search FRUCT Conference (AINL-ISMW FRUCT), 10.1109/AINL-ISMW-FRUCT.2015.7382977, (102-109), (2015).
- Asahi TAKAOKA, Satoshi TAYU, Shuichi UENO, OBDD Representation of Intersection Graphs, IEICE Transactions on Information and Systems, 10.1587/transinf.2014EDP7281, E98.D, 4, (824-834), (2015).
- Simone Bova, Friedrich Slivovsky, On Compiling Structured CNFs to OBDDs, Computer Science -- Theory and Applications, 10.1007/978-3-319-20297-6_6, (80-93), (2015).
- Quan Zu, Miaomiao Zhang, Bin Yu, Fast Dynamic Weight Matchings in Convex Bipartite Graphs, Mathematical Foundations of Computer Science 2015, 10.1007/978-3-662-48054-0_50, (601-612), (2015).
- Tian Liu, Zhao Lu, Ke Xu, Tractable connected domination for restricted bipartite graphs, Journal of Combinatorial Optimization, 10.1007/s10878-014-9729-x, 29, 1, (247-256), (2014).
- Tian Liu, Min Lu, Zhao Lu, Ke Xu, Circular convex bipartite graphs: Feedback vertex sets, Theoretical Computer Science, 10.1016/j.tcs.2014.05.001, 556, (55-62), (2014).
- Tian Liu, Restricted Bipartite Graphs: Comparison and Hardness Results, Algorithmic Aspects in Information and Management, 10.1007/978-3-319-07956-1_22, (241-252), (2014).
- Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu, Ke Xu, Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth, Frontiers in Algorithmics, 10.1007/978-3-319-08016-1_23, (252-263), (2014).
- Quan Zu, Miaomiao Zhang, Bin Yu, Dynamic Matchings in Left Weighted Convex Bipartite Graphs, Frontiers in Algorithmics, 10.1007/978-3-319-08016-1_30, (330-342), (2014).
- Nevzat Onur Domaniç, C. Gregory Plaxton, Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties, Algorithms and Computation, 10.1007/978-3-319-13075-0_51, (646-657), (2014).
- Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro, Sorting under partial information (without the ellipsoid algorithm), Combinatorica, 10.1007/s00493-013-2821-5, 33, 6, (655-697), (2014).
- Charles N. Glover, Michael O. Ball, Sparse Monge matrices arising from scheduling problems, Operations Research Letters, 10.1016/j.orl.2013.01.011, 41, 3, (246-248), (2013).
- Wei Jiang, Tian Liu, Chaoyi Wang, Ke Xu, Feedback vertex sets on restricted bipartite graphs, Theoretical Computer Science, 10.1016/j.tcs.2012.12.021, 507, (41-51), (2013).
- Raffay Hamid, Dennis Decoste, Chih-Jen Lin, undefined, 2013 IEEE Conference on Computer Vision and Pattern Recognition, 10.1109/CVPR.2013.375, (2914-2921), (2013).
- Zhao Lu, Min Lu, Tian Liu, Ke Xu, Circular Convex Bipartite Graphs: Feedback Vertex Set, Combinatorial Optimization and Applications, 10.1007/978-3-319-03780-6_24, (272-283), (2013).
- Aditya Khosla, Raffay Hamid, Chih-Jen Lin, Neel Sundaresan, undefined, 2013 IEEE Conference on Computer Vision and Pattern Recognition, 10.1109/CVPR.2013.348, (2698-2705), (2013).
- Zhao Lu, Tian Liu, Ke Xu, Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract), Computing and Combinatorics, 10.1007/978-3-642-38768-5_65, (721-728), (2013).
- Min Lu, Tian Liu, Ke Xu, Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 10.1007/978-3-642-38756-2_16, (142-152), (2013).
- C. Gregory Plaxton, Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs, Algorithms and Computation, 10.1007/978-3-642-45030-3_49, (524-534), (2013).
- Stefan Canzar, Khaled Elbassioni, Julián Mestre, A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem, ACM Journal of Experimental Algorithmics, 10.1145/2444016.2493372, 18, (2013).
- M.J. Kayasa, C. Herrmann, A Simulation-based Evaluation of Selective and Adaptive Production Systems (SAPS) Supported by Quality Strategy in Production, Procedia CIRP, 10.1016/j.procir.2012.07.004, 3, (14-19), (2012).
- Danny Z. Chen, Xiaomin Liu, Haitao Wang, Computing Maximum Non-crossing Matching in Convex Bipartite Graphs, Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 10.1007/978-3-642-29700-7_10, (105-116), (2012).
- Ruo-Wei Hung, Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs, Theory of Computing Systems, 10.1007/s00224-011-9378-8, 50, 4, (721-738), (2011).
- Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh, Finding Maximum Edge Bicliques in Convex Bipartite Graphs, Algorithmica, 10.1007/s00453-010-9486-x, 64, 2, (311-325), (2011).
- M. Gondran, Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles, RAIRO - Operations Research, 10.1051/ro/1979130100131, 13, 1, (13-21), (2011).
- A. Detti, G. Parca, V. Carrozzo, S. Betti, Optical Packet Network With Limited-Range Wavelength Conversion: A Novel Formalization of the Optimal Scheduling Problem, Journal of Lightwave Technology, 10.1109/JLT.2009.2033016, 27, 24, (5607-5618), (2009).
- Frédéric Gardi, Mutual exclusion scheduling with interval graphs or related classes, Part I, Discrete Applied Mathematics, 10.1016/j.dam.2008.04.016, 157, 1, (19-35), (2009).
- Michael Ball, Geir Dahl, Thomas Vossen, Matchings in connection with ground delay program planning, Networks, 10.1002/net.20272, 53, 3, (293-306), (2008).
- R.R. Kamalian, V.V. Mkrtchyan, On complexity of special maximum matchings constructing, Discrete Mathematics, 10.1016/j.disc.2007.04.029, 308, 10, (1792-1800), (2008).
- Albert Chan, Frank Dehne, Prosenjit Bose, Markus Latzel, Coarse grained parallel algorithms for graph matching, Parallel Computing, 10.1016/j.parco.2007.11.004, 34, 1, (47-62), (2008).
- Raymond R. Hoare, Zhu Ding, Alex K. Jones, A two-stage hardware scheduler combining greedy and optimal scheduling, Journal of Parallel and Distributed Computing, 10.1016/j.jpdc.2008.07.008, 68, 11, (1437-1451), (2008).
- Irit Katriel, Matchings in Node-Weighted Convex Bipartite Graphs, INFORMS Journal on Computing, 10.1287/ijoc.1070.0232, 20, 2, (205-211), (2008).
- C. Greg Plaxton, Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines, Automata, Languages and Programming, 10.1007/978-3-540-70575-8_19, (222-233), (2008).
- José Soares, Marco A. Stefanes, Algorithms for Maximum Independent Set in Convex Bipartite Graphs, Algorithmica, 10.1007/s00453-007-9006-9, 53, 1, (35-49), (2007).
- Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel, Dynamic Matchings in Convex Bipartite Graphs, Mathematical Foundations of Computer Science 2007, 10.1007/978-3-540-74456-6, (406-417), (2007).
- Z. Zhang, Y. Yang, Optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability, IEEE Transactions on Computers, 10.1109/TC.2006.14, 55, 1, (71-82), (2006).
- Raymond Hoare, Zhu Ding, Alex Jones, undefined, ACM/IEEE SC 2006 Conference (SC'06), 10.1109/SC.2006.3, (8-8), (2006).
- Willem-Jan van Hoeve, Irit Katriel, Global Constraints, Handbook of Constraint Programming, 10.1016/S1574-6526(06)80010-6, (169-208), (2006).
- Geir Dahl, Njål Foldnes, LP based heuristics for the multiple knapsack problem with assignment restrictions, Annals of Operations Research, 10.1007/s10479-006-0048-1, 146, 1, (91-104), (2006).
- Fabrizio Grandoni, Giuseppe F. Italiano, Algorithms and Constraint Programming, Principles and Practice of Constraint Programming - CP 2006, 10.1007/11889205_2, (2-14), (2006).
- Michael O. Ball, Geir Dahl, Thomas Vossen, Matchings in Connection with Ground Delay Program Planning, SSRN Electronic Journal, 10.2139/ssrn.939567, (2006).
- Wieslaw Kubiak, Solution of The Liu–Layland Problem Via Bottleneck Just-In-Time Sequencing, Journal of Scheduling, 10.1007/s10951-005-1638-5, 8, 4, (295-302), (2005).
- Wieslaw Kubiak, Balancing Mixed-Model Supply Chains, Graph Theory and Combinatorial Optimization, 10.1007/b135661, (159-189), (2005).
- Nicolas Beldiceanu, Irit Katriel, Sven Thiel, GCC-Like Restrictions on the Same Constraint, Recent Advances in Constraints, 10.1007/11402763_1, (1-11), (2005).
- undefined Zhenghao Zhang, undefined Yuanyuan Yang, Optimal scheduling algorithms in WDM optical interconnects with limited range wavelength conversion capability, IEEE Transactions on Parallel and Distributed Systems, 10.1109/TPDS.2004.68, 15, 11, (1012-1026), (2004).
- Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics, 10.1016/j.dam.2003.09.004, 145, 1, (11-21), (2004).
- N. Brauner, Y. Crama, The maximum deviation just-in-time scheduling problem, Discrete Applied Mathematics, 10.1016/S0166-218X(03)00222-1, 134, 1-3, (25-50), (2004).
- Z. Zhang, Y. Yang, undefined, International Conference on Parallel Processing, 2004. ICPP 2004., 10.1109/ICPP.2004.1327936, (301-308 vol.1), (2004).
- undefined Zhenghao Zhang, undefined Yuanyuan Yang, undefined, IEEE INFOCOM 2004, 10.1109/INFCOM.2004.1357022, (1372-1382), (2004).
- Zhenghao Zhang, Yuanyuan Yang, Optimal Scheduling Algorithms in WDM Optical Interconnects with Limited Range Wavelength Conversion Capability, Advances in Computer Systems Architecture, 10.1007/978-3-540-30102-8_28, (335-348), (2004).
- Tolga Çezik, Oktay Günlük, Reformulating linear programs with transportation constraints—With applications to workforce scheduling, Naval Research Logistics (NRL), 10.1002/nav.10115, 51, 2, (275-296), (2003).
- undefined Zhenghao Zhang, undefined Yuanyuan Yang, undefined, Proceedings International Parallel and Distributed Processing Symposium, 10.1109/IPDPS.2003.1213170, (8), (2003).
- J. Soares, M. Stefanes, undefined, Proceedings. 15th Symposium on Computer Architecture and High Performance Computing, 10.1109/CAHPC.2003.1250335, (167-174), (2003).
- Frédéric Gardi, Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems, Discrete Mathematics and Theoretical Computer Science, 10.1007/3-540-45066-1_13, (168-180), (2003).
- undefined Fugee Tsung, Impact of information sharing on statistical quality control, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 10.1109/3468.833103, 30, 2, (211-216), (2000).
- Chang Wu Yu, On the complexity of the maximum biplanar subgraph problem, Information Sciences, 10.1016/S0020-0255(00)00048-7, 129, 1-4, (239-250), (2000).
- Nesrine Abbas, Lorna K. Stewart, Biconvex graphs: ordering and algorithms, Discrete Applied Mathematics, 10.1016/S0166-218X(99)00217-6, 103, 1-3, (1-19), (2000).
- Jørgen Bang-Jensen, Jing Huang, Anders Yeo, Convex-Round and Concave-Round Graphs, SIAM Journal on Discrete Mathematics, 10.1137/S0895480197322154, 13, 2, (179-193), (2000).
- Kurt Mehlhorn, Sven Thiel, Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint, Principles and Practice of Constraint Programming – CP 2000, 10.1007/3-540-45349-0_23, (306-319), (2000).
- Kurt Mehlhorn, Constraint Programming and Graph Algorithms, Automata, Languages and Programming, 10.1007/3-540-45022-X_48, (571-575), (2000).
- Nesrine Abbas, Lorna Stewart, Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms, Discrete Applied Mathematics, 10.1016/S0166-218X(98)00094-8, 91, 1-3, (1-23), (1999).
- P. Bose, A. Chan, F. Dehne, M. Latzel, undefined, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999, 10.1109/IPPS.1999.760446, (125-129), (1999).
- undefined Fugee Tsung, undefined, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028), 10.1109/ICSMC.1999.814223, (964-967), (1999).
- Rainer E. Burkard, Eranda Çela, Linear Assignment Problems and Extensions, Handbook of Combinatorial Optimization, 10.1007/978-1-4757-3023-4, (75-149), (1999).
- Satoru Iwata, Tomomi Matsui, S.Thomas McCormick, A fast bipartite network flow algorithm for selective assembly, Operations Research Letters, 10.1016/S0167-6377(98)00017-0, 22, 4-5, (137-143), (1998).
- Yu Chang-Wu, Chen Gen-Huey, Ma Tze-Heng, On the complexity of the k-chain subgraph cover problem, Theoretical Computer Science, 10.1016/S0304-3975(97)00036-4, 205, 1-2, (85-98), (1998).
- Haiko Müller, Recognizing interval digraphs and interval bigraphs in polynomial time, Discrete Applied Mathematics, 10.1016/S0166-218X(97)00027-9, 78, 1-3, (189-205), (1997).
- G. Steiner, J.S. Yeomans, A linear time algorithm for maximum matchings in convex, bipartite graphs, Computers & Mathematics with Applications, 10.1016/0898-1221(96)00079-X, 31, 12, (91-96), (1996).
- Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka, Parallel maximum independent set in convex bipartite graphs, Information Processing Letters, 10.1016/0020-0190(96)00131-7, 59, 6, (289-294), (1996).
- N. Ranganathan, R. Chandra, undefined, Proceedings of 3rd International Conference on High Performance Computing (HiPC), 10.1109/HIPC.1996.565851, (379-384), (1996).
- Jon M. Peha, Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time, Computers & Operations Research, 10.1016/0305-0548(94)00090-U, 22, 10, (1089-1100), (1995).
- Y.Daniel Liang, Norbert Blum, Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits, Information Processing Letters, 10.1016/0020-0190(95)00145-3, 56, 4, (215-219), (1995).
- MYUNG-HO KIM, CHANG-SUNG JEONG, AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER, Parallel Algorithms and Applications, 10.1080/10637199508915473, 5, 1-2, (15-35), (1995).
- MYUNG-HO KIM, CHANG-SUNG JEONG, AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗, Parallel Algorithms and Applications, 10.1080/10637199508915505, 6, 2-3, (129-141), (1995).
- Chang-Wu Yu, Gen-Huey Chen, Efficient parallel algorithms for doubly convex-bipartite graphs, Theoretical Computer Science, 10.1016/0304-3975(94)00220-D, 147, 1-2, (249-265), (1995).
- undefined Myung-Ho Kim, undefined Chang-Sung Jeong, undefined Myung-Soo Kim, undefined, Proceedings of 8th International Parallel Processing Symposium, 10.1109/IPPS.1994.288296, (229-233), (1994).
- Ying Xu, Harold N. Gabow, Fast algorithms for transversal matroid intersection problems, Algorithms and Computation, 10.1007/3-540-58325-4_231, (625-633), (1994).
- Wieslaw Kubiak, Minimizing variation of production rates in just-in-time systems: A survey, European Journal of Operational Research, 10.1016/0377-2217(93)90215-9, 66, 3, (259-271), (1993).
- Janelie J. Harms, Charles J. Colbourn, Probabilistic single processor scheduling, Discrete Applied Mathematics, 10.1016/0166-218X(90)90132-V, 27, 1-2, (101-112), (1990).
- Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis, Systolic algorithms for some scheduling and graph problems, Journal of VLSI signal processing systems for signal, image and video technology, 10.1007/BF00929924, 1, 4, (307-320), (1990).
- J.M. Peha, F.A. Tobagi, undefined, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition, 10.1109/GLOCOM.1990.116473, (21-27), (1990).
- H.L. Lee, W.H. Hausman, G.J. Gutierrez, Optimal machine settings of imperfect component production processes for assembly operations, IEEE Transactions on Robotics and Automation, 10.1109/70.63268, 6, 6, (652-658), (1990).
- W.T. Liou, J.J.-M. Tan, R.C.T. Lee, Minimum rectangular partition problem for simple rectilinear polygons, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10.1109/43.55205, 9, 7, (720-733), (1990).
- O.H. Ibarra, T. Jiang, J.H. Chang, M.A. Palis, undefined, [1988] Proceedings. International Conference on Systolic Arrays, 10.1109/ARRAYS.1988.18065, (247-256), (1988).
- See more
