COMPUTING A MAXIMUM CARDINALITY MATCHING IN A BIPARTITE GRAPH IN TIME O(N1.5-SQUARE-ROOT-M/LOG N)

被引：79

作者：

ALT, H

BLUM, N

MEHLHORN, K

PAUL, M

机构：

[1] UNIV BONN,W-5300 BONN,GERMANY

[2] UNIV SAARLAND,FACHBEREICH INFORMAT,W-6600 SAARBRUCKEN,GERMANY

来源：

INFORMATION PROCESSING LETTERS | 1991年 / 37卷 / 04期

关键词：

ANALYSIS OF ALGORITHMS; BIPARTITE GRAPH; MATCHING;

D O I：

10.1016/0020-0190(91)90195-N

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We show how to compute a maximum cardinality matching in a bipartite graph of n vertices in time O(n1.5 square-root m/log n). For dense graphs this improves on the O(square-root n m) algorithm of Hopcroft and Karp. The speed-up is obtained by an application of the fast adjacency matrix scanning technique of Cheriyan, Hagerup and Mehlhorn.

引用

页码：237 / 240

页数：4

共 50 条

[41] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Peng, Z. S.
Ting, H. F.
INFORMATION PROCESSING LETTERS, 2006, 100 (04) : 137 - 144
[42] An O(n log n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
Peng, ZS
Ting, HF
ALGORITHMS AND COMPUTATION, 2004, 3341 : 754 - 765
[43] Balanced network flows.: VIII.: A revised theory of phase-ordered algorithms and the O(√nm log(n2/m)/log n) bound for the nonbipartite cardinality matching problem
Fremuth-Paeger, C
Jungnickel, D
NETWORKS, 2003, 41 (03) : 137 - 142
[44] Computing ε-free NFA from regular expressions in O(n log2(n)) time
Hagenah, C
Muscholl, A
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1998, 1998, 1450 : 277 - 285
[45] An O(n log n) Time Algorithm for Computing the Path-Length Distance Between Trees
Bryant, David
Scornavacca, Celine
ALGORITHMICA, 2019, 81 (09) : 3692 - 3706
[46] An O(n log n) Average Time Algorithm for Computing the Shortest Network under a Given Topology
G. Xue
D.-Z. Du
Algorithmica, 1999, 23 : 354 - 362
[47] An O(n plus m) time algorithm for computing a minimum semitotal dominating set in an interval graph
Pradhan, D.
Pal, Saikat
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2021, 66 (1-2) : 733 - 747
[48] An O(n log n) average time algorithm for computing the shortest network under a given topology
Xue, G
Du, DZ
ALGORITHMICA, 1999, 23 (04) : 354 - 362
[49] Computing the quartet distance between evolutionary trees in time O(n log2 n)
Brodal, GS
Fagerberg, R
Pedersen, CNS
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 731 - 742
[50] Minimum Cut in O(m log2 n) Time
Gawrychowski, Pawel
Mozes, Shay
Weimann, Oren
THEORY OF COMPUTING SYSTEMS, 2024, 68 (04) : 814 - 834

← 1 2 3 4 5 →