Visual ranking of link structures extended abstract

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

Volumn 2125, Issue , 2001, Pages 222-233

  Brandes, Ulrik ^a   Cornelsen, Sabine ^a  

^a UNIVERSITY OF KONSTANZ   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ITERATIVE METHODS; SEARCH ENGINES; VISUALIZATION;

EXPLOSIVE GROWTH; EXTENDED ABSTRACTS; ITERATIVE COMPUTATION; LINK STRUCTURE; QUERY RESULTS; RANKING MECHANISMS; WEB GRAPHS;

WORLD WIDE WEB;

EID: 84958060924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44634-6_21     Document Type: Conference Paper

References (30)

1. K. Bharat and M. R. Henzinger. Improved algorithms for topic distillation in a hyperlinked environment. In Proc. 21st Ann. Intl. ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 104–111, 1998.
2. P. Bonacich. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2:113–120, 1972.
3. P. Bonacich. Power and centrality: A family of measures. American Journal of Sociology, 92:1170–1182, 1987.
4. U. Brandes and D. Wagner. Contextual visualization of actor status in social networks. In Data Visualization 2000. Proc. 2nd Joint Eurographics and IEEE TCVG Symp. Visualization, pp. 13–22. Springer, 2000.
5. S. Brin, R. Motwani, L. Page, and T. Winograd. What can you do with a web in your pocket? IEEE Bulletin of the Technical Committee on Data Engineering, 21(2):37–47, June 1998.
6. S. Brin and L. Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1–7):107–117, 1998.
7. R. S. Burt. Toward a Structural Theoryof Action: Network Models of Social Structure, Perception, and Action. Academic Press, 1982.
8. S. Chakrabarti, B. E. Dom, R. Kumar, P. Raghavan, S. Rajagopalan, A. S. Tomkins, D. Gibson, and J. M. Kleinberg. Mining the Web’s link structure. IEEE Computer, 32(8):60–67, 1999.
9. S. Chakrabarti, B. E. Dom, P. Raghavan, S. Rajagopalan, D. Gibson, and J. M. Kleinberg. Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems, 30(1–7):65–74, 1998.
10. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.
11. L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1:215–239, 1979.
12. N. E. Friedkin. Theoretical foundations for centrality measures. American Journal of Sociology, 96(6):1478–1504, 1991.
13. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. In Proc. 8th Intl. Symp. Graph Drawing, LNCS 1984:211–221. Springer, 2001.
14. G. H. Golub and C. F. van Loan. Matrix Computations. Johns Hopkins University Press, 3rd ed., 1996.
15. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. In Proc. 8th Intl. Symp. Graph Drawing, LNCS 1984:183–196. Springer, 2001.
16. T. H. Haveliwala. Efficient computation of pagerank. Technical Report 1999-31, Database Group, Stanford University, 1999.
17. C. H. Hubbell. An input-output approach to clique identification. Sociometry, 28:377–399, 1965.
18. L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18:39–43, 1953.
19. M. Kaufmann and D. Wagner (eds). Drawing Graphs: Methods and Models, LNCS Tutorial 2025. Springer, 2001.
20. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604–632, 1999.
21. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. S. Tomkins, and E. Upfal. Stochastic models for the Web graph. In Proc. 41st Ann. IEEE Symp. Foundations of Computer Science, pp. 57–65, 2000.
22. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
23. B. Mohar. Some applications of Laplace eigenvalues of graphs. In Graph Symmetry. NATO ASI Series C 497, pp. 225–275. Kluwer, 1997.
24. G. Pinski and F. Narin. Citation influence for journal aggregates of scientific publications: Theory, with applications to the literature of physics. Information Processing and Management, 12(5):297–312, 1976.
25. P. Pirolli, J. Pitkow, and R. Rao. Silk from a sow’s ear: Extracting usable structures from the Web. In Proc. ACM Conf. Human Factors in Computing Systems, pp. 118–125, 1996.
26. D. A. Spielman and S.-H. Teng. Spectral graph partitioning works: Planar graphs and finite element meshes. In Proc. 37th Ann. IEEE Symp. Foundations of Computer Science, pp. 96–105, 1996.
27. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109–125, 1981.
28. W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, Third Series, 13:743–768, 1963.
29. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proc. 8th Intl. Symp. Graph Drawing, LNCS 1984:171–182. Springer, 2001.
30. D. J. Watts and S. H. Strogatz. Collective dynamics of “small-world” networks. Nature, 393:440–442, 1998.