All-cavity maximum matchings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1350, Issue , 1997, Pages 364-373

  Kao, Ming Yang ^a   Lam, Tak Wah ^b   Sung, Wing Kin ^b   Ting, Hing Fung ^b  

^a Yale University   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; GRAPH THEORY; IMAGE RETRIEVAL; TREES (MATHEMATICS);

ABSOLUTE VALUES; BIPARTITE GRAPHS; COMPUTATIONAL BIOLOGY; LINEAR TIME REDUCTION; MAXIMUM MATCHINGS; MAXIMUM WEIGHT MATCHING; TIME COMPLEXITY; TREE ALGORITHMS;

PROBLEM SOLVING;

EID: 84958045581     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63890-3_39     Document Type: Conference Paper

References (16)

1. R. E. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16:87-90, 1958.
2. D. P. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem. LIDS Report P-1653, Massachusetts Institute of Technology, Cambridge, MA, 1987.
3. T. H. Cormen, C. L. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1991.
4. N. Deo and C. Pang. Shortest-path algorithms: Taxonomy and annotation. Networks, 14:275-323, 1984.
5. R. W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5:345, 1962.
6. L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, N J, 1962.
7. M. L. Fredman and R. E. Tarjan. Fibonacei heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596 615, 1987.
8. H. N. Gabow. Scaling algorithms for network problems. Journal of Computer and System Sciences, 31:148 168, 1985.
9. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18:1013 1036, 1989.
10. H. N. Gabow and R. E. Tarjan. Faster scaling algorithms for general graphmatching problems. Journal of the ACM, 38:815-853, 1991.
11. A. V. Goldberg. Scaling algorithms for the shortest paths problem. SIAM Journal on Computing, 24:494-504, 1995.
12. A. V. Goldberg and R. E. Tarjan. Solving minimum-cost flow problems by successive approximation. In Proceedings of the 19th Annual A CM Symposium on Theory of Computing, pages 7-18, 1987.
13. J. E. Hopcroft and R. M. Karp. An n s/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2:225-231, 1973.
14. D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24:1-13, 1977.
15. th Annual ACM Symposium on Theory of Computing, pages 54-65, 1997.
16. D. R. Karger, D. Koller, and S. J. Phillips. Finding the hidden path: Time boundsfor all-pairs shortest paths. SIAM Journal on Computing, 22:1199-1217, 1993.