Web page grouping based on parameterized connectivity

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

Volumn 2973, Issue , 2004, Pages 374-380

  Masada, Tomonari ^a   Takasu, Atsuhiro ^b   Adachi, Jun ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; HYPERTEXT SYSTEMS; WEBSITES;

CONNECTED COMPONENT; EXPLOSIVE GROWTH; HYPERLINKS; PARALLELIZATIONS; PARAMETERIZED; SHORTEST PATH ALGORITHMS; STRONGLY CONNECTED COMPONENT; THRESHOLD PARAMETERS;

WORLD WIDE WEB;

EID: 35048841332     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24571-1_34     Document Type: Article

References (13)

1. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval. Addison-Wesley, 1999.
2. T. Kanazawa, A. Takasu, and J. Adachi, "A relevance-based superimposition model for effective information retrieval," IEICE Trans. Inf. & Syst., vol. E83-D, no. 12, pp. 2152-2160, 2000.
3. K. Tajima, Y. Mizuuchi, M. Kitagawa, and K. Tanaka, "Cut as a querying unit for WWW, Netnews, and E-mail," in Proc. ACM Hypertext '98, pp. 235-244, 1998.
4. I. S. Dhillon, "Co-clustering documents and words using bipartite spectral graph partitioning," tech. rep. #TR 2001-05, Dept. of Computer Sciences, University of Texas at Austin, 2001.
5. R. Kannan, S. Vempala, and A. Vetta, "On clusterings - good, bad and spectral," in Proc. 41st FOGS, pp. 367-377, 2000.
6. J. M. Kleinberg, "Authoritative sources in a hyperlinked environment," Journal of the ACM, vol. 46, no. 5, pp. 604-632, 1999.
7. A. Borodin, G. O. Roberts, J. S. Rosenthal, and P. Tsaparas, "Finding authorities and hubs from link structures on the world wide web," in Proc. 10th WWW Conf., pp. 415-429, 2001.
8. T. Masada, A. Takasu, and J. Adachi, "Decomposing the web graph into parameterized connected components," IEICE Trans. Special Issue on Information Processing Technology for Web Utilization, vol. E87-D, no. 2, 2004.
9. A. Z. Broder, S. R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener, "Graph structure in the web," in Proc. 9th WWW Conf., pp. 309-320, 2000.
10. C. Cooper and A. Frieze, "The size of the largest strongly connected component of a random digraph with a given degree sequence (pre-print)," available at http://wwy.math.cmu.edu/~aflp/papers.html, 2002.
11. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
12. T. Takaoka, "Theory of trinomial heaps," in Proc. COCOON 2000, pp. 362-372, 2000.
13. R. E. Tarjan, "Depth first search and linear graph algorithms," SIAM J. Comput., vol. 1, pp. 146-160, 1972.