Finding Perfect Matchings in Bipartite Hypergraphs

被引：0

|

作者：

Chidambaram Annamalai

机构：

[1] ETH Zurich,Department of Computer Science

来源：

Combinatorica | 2018年 / 38卷

关键词：

05C65; 05C70; 05C85;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：1285 / 1307

页数：22

相关论文

共 50 条

[1] Finding Perfect Matchings in Bipartite Hypergraphs
Annamalai, Chidambaram
[J]. COMBINATORICA, 2018, 38 (06) : 1285 - 1307
[2] Finding Perfect Matchings in Dense Hypergraphs
Han, Jie
Keevash, Peter
[J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2366 - 2377
[3] Finding Perfect Matchings in Dense Hypergraphs
Han, Jie
Keevash, Peter
[J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2366 - 2377
[4] FINDING ALL THE PERFECT MATCHINGS IN BIPARTITE GRAPHS
FUKUDA, K
MATSUI, T
[J]. APPLIED MATHEMATICS LETTERS, 1994, 7 (01) : 15 - 18
[5] Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
[J]. JOURNAL OF GRAPH THEORY, 2006, 53 (03) : 209 - 232
[6] Perfect matchings in balanced hypergraphs
Conforti, M
Cornuejols, G
Kapoor, A
Vuskovic, K
[J]. COMBINATORICA, 1996, 16 (03) : 325 - 329
[7] FINDING ALL MINIMUM-COST PERFECT MATCHINGS IN BIPARTITE GRAPHS
FUKUDA, K
MATSUI, T
[J]. NETWORKS, 1992, 22 (05) : 461 - 468
[8] Packing perfect matchings in random hypergraphs
Ferber, Asaf
Van Vu
[J]. RANDOM STRUCTURES & ALGORITHMS, 2018, 52 (03) : 367 - 378
[9] Perfect matchings in random uniform hypergraphs
Kim, JH
[J]. RANDOM STRUCTURES & ALGORITHMS, 2003, 23 (02) : 111 - 132
[10] Perfect fractional matchings in random hypergraphs
Krivelevich, M
[J]. RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (03) : 317 - 334

← 1 2 3 4 5 →