A simple matching algorithm for regular bipartite graphs☆
References (8)
- et al.
A matching algorithm for regular bipartite graphs
Discrete Appl. Math.
(1992) - et al.
Edge-coloring bipartite graphs
J. Algorithms
(2000) Two problems in graph theory, Ph.D. Thesis
(1982)- et al.
On edge coloring bipartite graphs
SIAM J. Comput.
(1982)
Cited by (6)
Space-efficient Euler partition and bipartite edge coloring
2019, Theoretical Computer ScienceCitation Excerpt :First, following Schrijver [23], the problem is reduced to perfect matching in a regular bipartite graph. Subsequently, using a technique introduced by Cole and Hopcroft [7] and called edge-sparsification by Makino, Takabatake and Fujishige [21], the regular bipartite graph is replaced by a bipartite graph with few edges, each with an integer weight, in which regularity is replaced by weight-regularity: The weight of each vertex v, defined to be the sum of the weights of the edges incident with v, is the same for all v. Finally we describe space-efficient versions of algorithms of Schrijver [23] and Alon [1] for perfect matching in such graphs. In this subsection we describe a space-efficient implementation of a reduction of Schrijver [23] from top matching in bipartite graphs to perfect matching in regular bipartite graphs.
Space-effcient euler partition and bipartite edge coloring
2017, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Detecting signage and doors for blind navigation and wayfinding
2013, Network Modeling and Analysis in Health Informatics and BioinformaticsIndoor signage detection based on saliency map and bipartite graph matching
2011, 2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2011Heuristic algorithm for a military training timetabling problem
2009, Asia Pacific Management ReviewAnother simple algorithm for edge-coloring bipartite graphs
2005, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
- ☆
This work was supported in part by Grants-in-Aid for Scientific Research by the Ministry of Education, Science, Sports, Culture and Technology of Japan.