|
253
|
Maximum matching and a polyhedron with (0,1)-vertices
– J Edmonds
- 1965
|
|
66
|
Faster scaling algorithms for general graph-matching problems
– Harold N. Gabow, Robert E. Tarjan
- 1991
|
|
110
|
Data structures for weighted matching and nearest common ancestors with linking
– H N Gabow
- 1990
|
|
23
|
Quality Matching and Local Improvement for Multilevel Graph-Partitioning
– Burkhard Monien, Robert Preis, Ralf Diekmann
- 1999
|
|
20
|
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
– Robert Preis
- 1998
|
|
44
|
The Analysis of Algorithms
– P W Purdom, C A Brown
- 1985
|
|
42
|
Ratio regions’: A technique for image segmentation
– I J COX, S B RAO, Y ZHONG
- 1996
|
|
1824
|
Normalized Cuts and Image Segmentation
– Jianbo Shi, Jitendra Malik
- 2000
|
|
17
|
An O(EV log V ) algorithm for finding a maximal weighted matching in general graphs
– Z Galil, S Micali, H Gabow
- 1986
|
|
387
|
Combinatory Optimization: Networks and Matroids
– E L Lawler
- 1976
|
|
31
|
Efficient Implementation of Graph Algorithms Using Contraction
– H Gabow, Z Galil, T Spencer
- 1984
|
|
1107
|
Network Flows: Theory, Algorithms, and Applications
– Ravindra K Ahuja, Thomas L Magnanti, James B Orlin
- 1993
|
|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
6
|
Tarjan, "Faster scaling algorithms for general graph matching problems
– H N Gabow, R E
- 1991
|
|
5
|
Leaf Cell and Hierarchical Compaction Techniques
– C Bamji, R Varadarajan
- 1997
|
|
64
|
Finding a Maximum Cut of a Planar Graph in Polynomial Time
– F Hadlock
- 1975
|
|
308
|
A General Approximation Technique For Constrained Forest Problems
– Michel Goemans, David P. Williamson
- 1992
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
9
|
An O( √ |V||E|) Algorithm for Finding Maximum Matching
– S Micali, V V Vazirani
- 1980
|
