Perfect matchings and ears in elementary bipartite graphs

被引：0
|
作者：
GERAD, Ecole des Hautes Etudes Commerciales, 5255 avenue Decellez, Montréal, Que. H3T 1V6, Canada [1 ]
机构：
来源：
Discrete Math | / 1-3卷 / 131-138期
关键词：
The first author has been supported by FCAR (Fonds pour la Formation de Chercheurs et l'Aide ~t la recherche) grant 92EQ1048; NSERC (Natural Science and Engineering Research Council of Canada) grant to H.E.C. and grant GP105574; the third author has been supported by the International Fellowships Program of NSERC. The authors thank the referees for their valuable suggestions;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
12
引用
收藏
相关论文
共 50 条
  • [31] Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
    Boros, Endre
    Elbassioni, Khaled
    Gurvich, Vladimir
    JOURNAL OF GRAPH THEORY, 2006, 53 (03) : 209 - 232
  • [32] Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs
    Uno, T
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 92 - 101
  • [33] FINDING ALL MINIMUM-COST PERFECT MATCHINGS IN BIPARTITE GRAPHS
    FUKUDA, K
    MATSUI, T
    NETWORKS, 1992, 22 (05) : 461 - 468
  • [34] A Note on Matchings of Bipartite Graphs
    蔡小涛
    应用数学, 1991, (01) : 97 - 100
  • [35] Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs
    Diaconis, Persi
    Kolesnik, Brett
    ADVANCES IN APPLIED MATHEMATICS, 2021, 131
  • [36] Algorithms for generating minimal blockers of perfect matchings in bipartite graphs and related problems
    Boros, E
    Elbassioni, K
    Gurvich, V
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 122 - 133
  • [37] Coloured matchings in bipartite graphs
    Cameron, K
    DISCRETE MATHEMATICS, 1997, 169 (1-3) : 205 - 209
  • [38] INDUCED MATCHINGS IN BIPARTITE GRAPHS
    FAUDREE, RJ
    GYARFAS, A
    SCHELP, RH
    TUZA, Z
    DISCRETE MATHEMATICS, 1989, 78 (1-2) : 83 - 87
  • [39] PERFECT MATCHINGS IN O(n log n) TIME IN REGULAR BIPARTITE GRAPHS
    Goel, Ashish
    Kapralov, Michael
    Khanna, Sanjeev
    SIAM JOURNAL ON COMPUTING, 2013, 42 (03) : 1392 - 1404
  • [40] Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs
    Goel, Ashish
    Kapralov, Michael
    Khanna, Sanjeev
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 39 - 46
12345