An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Zvi Galil; Silvio Micali; Harold Gabow

doi:10.1137/0215009

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

SIAM Journal on Computing ◽

10.1137/0215009 ◽

1986 ◽

Vol 15 (1) ◽

pp. 120-130 ◽

Cited By ~ 67

Author(s):

Zvi Galil ◽

Silvio Micali ◽

Harold Gabow

Keyword(s):

Weighted Matching ◽

General Graphs

Download Full-text

Scaling Algorithms for Weighted Matching in General Graphs

ACM Transactions on Algorithms ◽

10.1145/3155301 ◽

2018 ◽

Vol 14 (1) ◽

pp. 1-35 ◽

Cited By ~ 9

Author(s):

Ran Duan ◽

Seth Pettie ◽

Hsin-Hao Su

Keyword(s):

Weighted Matching ◽

Scaling Algorithms ◽

General Graphs

Download Full-text

Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs

2007 IEEE Information Theory Workshop ◽

10.1109/itw.2007.4313081 ◽

2007 ◽

Cited By ~ 9

Author(s):

Sujay Sanghavi

Keyword(s):

Lp Relaxation ◽

Weighted Matching ◽

General Graphs

Download Full-text

A scaling algorithm for weighted matching on general graphs

26th Annual Symposium on Foundations of Computer Science (sfcs 1985) ◽

10.1109/sfcs.1985.3 ◽

1985 ◽

Cited By ~ 40

Author(s):

Harold N. Gabow

Keyword(s):

Weighted Matching ◽

General Graphs

Download Full-text

Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs

10.1109/sfcs.1982.36 ◽

1982 ◽

Cited By ~ 19

Author(s):

Zvi Galil ◽

Silvio Micali ◽

Harold Gabow

Keyword(s):

Priority Queues ◽

Weighted Matching ◽

General Graphs

Download Full-text

Scaling Algorithms for Weighted Matching in General Graphs

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611974782.50 ◽

2017 ◽

Cited By ~ 2

Author(s):

Ran Duan ◽

Seth Pettie ◽

Hsin-Hao Su

Keyword(s):

Weighted Matching ◽

Scaling Algorithms ◽

General Graphs

Download Full-text

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

STACS 99 - Lecture Notes in Computer Science ◽

10.1007/3-540-49116-3_24 ◽

1999 ◽

pp. 259-269 ◽

Cited By ~ 74

Author(s):

Robert Preis

Keyword(s):

Approximation Algorithm ◽

Linear Time ◽

Weighted Matching ◽

General Graphs

Download Full-text

Belief Propagation and LP Relaxation for Weighted Matching in General Graphs

IEEE Transactions on Information Theory ◽

10.1109/tit.2011.2110170 ◽

2011 ◽

Vol 57 (4) ◽

pp. 2203-2212 ◽

Cited By ~ 23

Author(s):

S Sanghavi ◽

D Malioutov ◽

A Willsky

Keyword(s):

Belief Propagation ◽

Lp Relaxation ◽

Weighted Matching ◽

General Graphs

Download Full-text

Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs

Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/3-540-44929-9_7 ◽

2000 ◽

pp. 84-98 ◽

Cited By ~ 5

Author(s):

Ryuhei Uehara ◽

Zhi -Zhong Chen

Keyword(s):

Approximation Algorithms ◽

Weighted Matching ◽

Parallel Approximation ◽

General Graphs

Download Full-text

Parallel approximation algorithms for maximum weighted matching in general graphs

Information Processing Letters ◽

10.1016/s0020-0190(00)00128-9 ◽

2000 ◽

Vol 76 (1-2) ◽

pp. 13-17 ◽

Cited By ~ 16

Author(s):

Ryuhei Uehara ◽

Zhi-Zhong Chen

Keyword(s):

Approximation Algorithms ◽

Weighted Matching ◽

Parallel Approximation ◽

General Graphs

Download Full-text

Distributed garbage collection for general graphs

ACM SIGPLAN Notices ◽

10.1145/3299706.3210572 ◽

2018 ◽

Vol 53 (5) ◽

pp. 29-44

Author(s):

Steven R. Brandt ◽

Hari Krishnan ◽

Costas Busch ◽

Gokarna Sharma

Keyword(s):

Garbage Collection ◽

Distributed Garbage Collection ◽

General Graphs

Download Full-text