Searching the Web

ACM Transactions on Internet Technology

Volumn 1, Issue 1, 2001, Pages 2-43

  Arasu, Arvind ^a   Cho, Junghoo ^a   Garcia Molina, Hector ^a   Paepcke, Andreas ^a   Raghavan, Sriram ^a  

^a Stanford University   (United States)

Author keywords

Algorithms; Authorities; Crawling; Design; Hits; Indexing; Information retrieval; Link analysis; Pagerank; Performance; Search engine

Indexed keywords

EID: 84880240041     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/383034.383035     Document Type: Article

References (28)

1. Avis, D. 1983. A survey of heuristics for the weighted matching problem. Networks 13, 475-493.
2. Beier, R., and Sibeyn, J. F. 2000. A powerful heuristic for telephone gossiping. In Proceedings of the 7th Colloquium on Structural Information and Communication Complexity. Carleton Scientific. 17-35.
3. Cook, W., and Rohe, A. 1999. Computing minimum-weight perfect matchings. INFORMS J. Comput. 11, 138-148.
4. Drake, D. E., and Hougardy, S. 2003a. Improved linear time approximation algorithms for weighted matchings. In Approximation, Randomization, and Combinatorial Optimization, (Approx/Random), S. Arora, K. Jansen, J. D. P. Rolim, and A. Sahai, Eds. Lecture Notes in Computer Science, vol. 2764. Springer-Verlag, New York, 14-23.
5. Drake, D. E., and Hougardy, S. 2003b. Linear time local improvements for weighted matchings in graphs. In Workshop on Efficient Algorithms (WEA), K. Jansen, M. Margraf, M. Mastrolli, and J. Rolim, Eds. Lecture Notes in Computer Science, vol. 2647. Springer-Verlag, New York, 107-119.
6. Drake, D. E., and Hougardy, S. 2003c. A simple approximation algorithm for the weighted matching problem. Inf. Proc. Lett. 85, 211-213.
7. Drake, D. E., and Hougardy, S. 2004. Approximating weighted matchings in parallel. Tech. rep., Humboldt-Universität zu Berlin, Berlin, Germany.
8. Edmonds, J. 1965. Maximum matching and a polyhedron with 0, 1-vertices. J. Res. Nat. Bur. Standards 69B, 125-130.
9. Frommel, C., Gille, C., Goede, A., Gropl, C., Hougardy, S., Nierhoff, T., R. Preissner, and Thimm, M. 2003. Accelerating screening of 3D protein data with a graph theoretical approach. Bioinformatics 19, 2442-2447.
10. Gabow, H. N. 1976. An efficient implementation of edmond's algorithm for maximum matching on graphs. J. ACM 23, 221-234.
11. Gabow, H. N. 1990. Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 434-443.
12. Gabow, H. N., Galil, Z., and Spencer, T. H. 1989. Efficient implementation of graph algorithms using contraction. J. ACM 36, 540-572.
13. Gabow, H. N., and Tarjan, R. E. 1991. Faster scaling algorithms for general graph-matching problems. J. ACM 38, 815-853.
14. Galil, Z., Micali, S., and Gabow, H. 1986. An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15, 120-130.
15. Hanke, S. 2004. Zwei approximative algorithmen für das matchingproblem in gewichteten graphen. Ph.D. dissertation. Diplomarbeit, Humboldt-Universität zu Berlin, Berlin, Germany.
16. Karypis, G., and Kumar, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392.
17. Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
18. Lipton, R. J., and Tarjan, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189.
19. Lipton, R. J., and Tarjan, R. E. 1980. Applications of a planar separator theorem. SIAM J. Comput. 9, 615-627.
20. Mehlhorn, K., and Schfer, G. 2001. Implementation of O(nm log n) weighted matchings in general graphs: the power of data structures. In Proceedings of the 4th International Workshop on Algorithm Engineering (WAE) 2000, S. Naher and D. Wagner, Eds. Lecture Notes in Computer Science, vol. 1982. Springer-Verlag, New York, 23-38.
21. Micali, S., and Vazirani, V. V. 1980. An O(VVE) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 17-27.
22. Mohring, R. H., and Müller-Hannemann, M. 2000. Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica 26, 148-171.
23. Monien, B., Preis, R., and Diekmann, R. 2000. Quality matching and local improvement for multilevel graph-partitioning. Paral. Comput. 26, 1609-1634.
24. Pettie, S., and Sanders, P. 2004. A simpler linear time 2/3 - e approximation for maximum weight matching. Inf. Proc. Lett. 91, 271-276.
25. Preis, R. 1999. Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS) 1999, C. Meinel and S. Tison, Eds. Lecture Notes in Computer Science, vol. 1563. Springer-Verlag, New York, 259-269.
26. Purdom, P. W., and Brown, C. A. 1985. The Analysis of Algorithms. Holt, Rinehart and Winston, New York.
27. Tarjan, R. E. 1983. Data structures and network algorithms. In CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 44. SIAM, Philadelphia, Pa.
28. Vazirani, V. V. 1994. A theory of alternating paths and blossoms for proving correctness of the O (\[VE) maximum matching algorithm. Combinatorica 14, 71-109.