Lehrstuhl für Effiziente Algorithmen
|
TU München,
Institut für Informatik Lehrstuhl für Effiziente Algorithmen |
|
| [Ada99] | Lada A. Adamic. The Small World Web. In S. Abiteboul and A.-M. Vercoustre, editors, Proc. 3rd European Conf. Research and Advanced Technology for Digital Libraries, ECDL, number 1696 in Lecture Notes in Computer Science, LNCS. Springer-Verlag, September 1999. |
| [AJB99] | Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi. The diameter of the world wide web. Nature, 401:130-131, 1999. |
| [BAH99] | Albert-Laszlo Barabasi, Reka Albert, and Jeong Hawoong. Mean-field theory for scale-free random networks. Physica A, 272:173-187, 1999. |
| [BKM+00] | Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan,
Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and
Janet Wiener. Graph structure in the web: experiments and models. In Proceedings of the Ninth International World Wide Web Conference, Amsterdam, Netherlands, 15-19 May 2000. |
| [BP98] | Sergey Brin and Lawrence Page. The Anatomy of a Large-Scale Hypertextual Web Search Engine. In Proc. 7th Int. World Wide Web Conf., 14-18 April 1998. |
| [CSZ93] | P. K. Chan, M. D. F. Schlag, and J. Y. Zien. Spectral k-way ratio-cut partitioning and clustering. In ACM-SIGDA; IEEE, Proceedings of the 30th ACM/IEEE Design Automation Conference, pages 749-754, Dallas, TX, June 1993. ACM Press. |
| [DC98] | E. Dengler and W. Cowan. Human perception of laid-out graphs. Lecture Notes in Computer Science, 1547:441-443, 1998. |
| [DETT98] | Giuseppe Di Battista, Peter Eades, Roberto Tamassia,
and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Upper Saddle River, New Jersey 07458, USA, July 1998. |
| [DFS99] | R. G. Downey, M. R. Fellows, and U. Stege. Computational Tractability: The View From Mars. Bulletin of the European Association for Theoretical Computer Science, 69:73-97, October 1999. Columns: Computational Complexity. |
| [Ee96] | P. Eades and Q.W. Feng Multilevel visualization of clustered graphs. In Proc. Graph Drawing, GD, number 1190 in Lecture Notes in Computer Science, LNCS, pages 101-112, Berlin, Germany, 18-20 September 1996. Springer-Verlag. |
| [Ern98] | J. Ernst Ein System zur Visualisierung und Animation paralleler Graph-Algorithmen. Diplomarbeit, Technische Universität München, Institut für Informatik, 1998. |
| [Ern00] | J. Ernst A spectral approach to clustering gene expression profiles. Submitted to RECOMB 2001. |
| [FM82] | C. M. Fiduccia and R. M. Mattheyses A linear-time heuristic for improving network partitions. In ACM IEEE Nineteenth Design Automation Conference Proceedings, pages 175-181, Los Alamitos, Ca., USA, June 1982. IEEE Computer Society Press. |
| [GJ79] | Michael R. Garey and David S. Johnson Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, 1979. |
| [GPS90] | J. Garbers, H. J. Prömel and A. Steger Finding clusters in VLSI circuits. In Proceedings of the IEEE International Conference on Computer-Aided Design, pages 520-523, Santa Clara, CA, November 1990. IEEE Computer Society Press. |
| [Hol99] | K. Holzapfel WWW-Visualisierung und Analyse von Push-Relabel-Flußalgorithmen. Diplomarbeit, Technische Universität München, Institut für Informatik, 1999. |
| [KL70] | B. W. Kernighan and S. Lin An efficient heuristic for partitioning graphs. Bell Systems Technical J., 49:291-307, 1970. |
| [Kle98] | Jon M. Kleinberg Authoritative sources in a hyperlinked environment. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 668-677, San Francisco, California, 25-27 January 1998. |
| [Kle00] | Jon M. Kleinberg The small-world phenomenon: An algorithm perspective. In ACM Symposium on Theory of Computing (STOC), 2000. |
| [Len90] | T. Lengauer Combinatorial Algorithms for Integrated Circuit Layout. B.G. Teubner, Stuttgart, 1990. |
| [RS97] | T. Roxborough and A. Sen Graph clustering using multiway ratio cut. In Giuseppe Di Battista, editor, Proc. 5th Int. Symp. Graph Drawing, GD, number 1353 in Lecture Notes in Computer Science, LNCS, pages 291-296. Springer-Verlag, 18-20 September 1997. |
| [Thi99] | J. Thiel Ein System zur Berechnung von Organigramm-Layouts. Diplomarbeit, Technische Universität München, Institut für Informatik, 1999. |
| [Wat99] | Duncan J. Watts Small Worlds. Princeton University Press, Princeton, USA, 1999. |
| [WC91] | Y. C. Wei and C. K. Cheng Ratio cut partitioning for hierarchical designs. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 10(7):911-921, July 1991. |
| [WS98] | Duncan J. Watts and Steven H. Strogatz Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998. |