scholarly journals A perfect matching algorithm for sparse bipartite graphs

1984 ◽  
Vol 9 (3) ◽  
pp. 263-268
Author(s):  
Eugeniusz Toczyłowski
Keyword(s):  
Perfect Matching ◽  
Bipartite Graphs ◽  
Matching Algorithm

A simple matching algorithm for regular bipartite graphs

2002 ◽  
Vol 84 (4) ◽  
pp. 189-193 ◽  
Author(s):  
Kazuhisa Makino ◽  
Takashi Takabatake ◽  
Satoru Fujishige
Keyword(s):  
Bipartite Graphs ◽  
Matching Algorithm

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting

2013 ◽  
Vol 22 (5) ◽  
pp. 783-799 ◽  
Author(s):  
GUILLEM PERARNAU ◽  
ORIOL SERRA
Keyword(s):  
Bipartite Graph ◽  
High Probability ◽  
Perfect Matching ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Perfect Matchings ◽  
Asymptotic Enumeration ◽  
Complete Bipartite Graphs ◽  
Edge Colourings ◽  
Square Matrix

A perfect matchingMin an edge-coloured complete bipartite graphKn,nis rainbow if no pair of edges inMhave the same colour. We obtain asymptotic enumeration results for the number of rainbow perfect matchings in terms of the maximum number of occurrences of each colour. We also consider two natural models of random edge-colourings ofKn,nand show that if the number of colours is at leastn, then there is with high probability a rainbow perfect matching. This in particular shows that almost every square matrix of ordernin which every entry appearsntimes has a Latin transversal.

scholarly journals Space complexity of perfect matching in bounded genus bipartite graphs

2012 ◽  
Vol 78 (3) ◽  
pp. 765-779 ◽  
Author(s):  
Samir Datta ◽  
Raghav Kulkarni ◽  
Raghunath Tewari ◽  
N.V. Vinodchandran
Keyword(s):  
Perfect Matching ◽  
Bipartite Graphs ◽  
Space Complexity

scholarly journals A matching algorithm for regular bipartite graphs

1992 ◽  
Vol 35 (3) ◽  
pp. 197-203 ◽  
Author(s):  
J. Csima ◽  
L. Lovász
Keyword(s):  
Bipartite Graphs ◽  
Matching Algorithm
Sign in / Sign up

Export Citation Format

Share Document