Text Reference

[1] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein, Introduction to Algorithm by Prentice Hall India

[2] Alfred V Aho & John E Hopcroft & Jeffrey Ullman, The Design and Analysis of Computer Algorithm by Pearson Education, India.

[3] V. K. Balakrishnan, Theory and problems of graph theory by McGraw-Hill Companies.

[4] C L Liu & D. P. Mohpatra, Elements of Discrete Mathematics: A Computer Oriented Approach by McGraw-Hill Companies.

[5] Hamdy A. Taha, Operations Research by Prentice Hall India

[6] David E. Goldberg, Genetic algorithm in search, optimization and machine language by Pearson Education, India

[7] Microsoft Press, Optimizing Network Traffic by Prentice Hall India

[8] Ellis Horowitz, sartaj Sahni & Sanguthevar Rajasekaran, Computer algorithms by Galgotia Press

1

References & Bibliography

[1] Abraham D. Flaxman, Alan M. Frieze, and Juan Vera. A geometric preferential attachment model of networks ii. In Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings, pages 41–55, 2007.

[2] Boris V. Cherkassky, Andrew V. Goldberg, and Craig Silverstein. Buckets, heaps,lists, and monotone priority queues. SIAM Journal on Computing, 28(4):1326–1346, 1999.

[3] Boris V. Cherkassky, Andrew V. Goldberg, and Tomasz Radzik. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73:129–174, 1996.

[4] Daniel Delling, Thomas Pajor, Dorothea Wagner, and Christos D. Zaroliagis. Efficient route planning in flight networks. In ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, IT University of Copenhagen, Denmark, September 10, 2009, 2009.

[5] Danny Z. Chen, D. T. Lee, R. Sridhar, and Chandra N. Sekharan. Solving the all- pair shortest path query problem on interval and circular-arc graphs. Networks,31(4):249–258, 1998.

[6] Duncan J. Watts and Steven H. Strogatz. Collective dynamics of ‘small-world’ networks. Nature, pages 440–442, 1998

[7] Deepayan Chakrabarti and Christos Faloutsos. Graph mining: Laws, generators, and algorithms. ACM Computing Surveys, 38(1):2, 2006.

[8] Danny Z. Chen. Developing algorithms and software for geometric path planning problems. ACM Computing Surveys, page 18, 1996.

[9] Edward P. Chan and Heechul Lim. Optimization and evaluation of shortest path queries. The VLDB Journal, 16(3):343–369, 2007.

[10] Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 32(5):1338– 1355,2003. Announced at SODA 2002.

[11] Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessan-dro Panconesi, and Prabhakar Raghavan. Models for the compressible web. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS),pages 331–340, 2009.

2

[12] Gruia Calinescu, Howard J. Karloff, and Yuval Rabani. Approximation algorithms for the 0-extension problem. SIAM Journal on Computing, 34(2):358– 372, 2004. Announced at SODA 2001.

[13] Jason Cong, Andrew B. Kahng, and Kwok-Shing Leung. Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. In International Symposium on Physical Design, pages 88– 95, 1997.

[14] Jesus Gomez-Gardenes and Yamir Moreno. From scale-free to Erdos-Renyi networks. Physical Review E (Statistical, Nonlinear, and Soft Matter Physics),73 (5):056124, 2006.

[15] Jeffrey D. Ullman and Mihalis Yannakakis. The input/output complexity of transitive closure. ACM SIGMOD Record, 19(2):44–53, 1990.

[16] Laurent D. Cohen and Ron Kimmel. Global minimum for active contour models: A minimal path approach. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 666–673, 1996.

[17] Mark E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167–256, 2003.

[18] Mark E. J. Newman. Models of the small world. Journal of Statistical Physics, pages 819–841, 2000.

[19] Paul B. Callahan and S. Rao Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM, 42(1):67–90, 1995.

[20] Ravi Kumar and Matthieu Latapy. Preface. Theoretical Computer Science: special issue on Complex Networks, 355(1):1–5, 2006.

[21] Stefano Boccaletti, Vito Latora, Yamir Moreno, Mario Chavez, and Dong-Uk Hwang. Complex networks: Structure and dynamics. Physics Reports, 424:175– 308, 2006.

[22] Takashi Washio and Hiroshi Motoda. State of the art of graph-based data mining.ACM SIGKDD Explorations Newsletter, 5(1):59–68, 2003.

[23] Torben Hagerup. Dynamic algorithms for graphs of bounded treewidth. Algorithmica, 27(3):292–315, 2000. Announced at ICALP 1997.

[24] Torben Hagerup. Improved shortest paths on the word RAM. In Automata, Languages and Programming, 27th International Colloquium, ICALP 2000,

3

Geneva, Switzerland, July 9-15, 2000, Proceedings, pages 61–72, 2000.

[25] Torben Hagerup. Simpler computation of single-source shortest paths in linear average time. Theory of Computing Systems, 39(1):113–120, 2006.

[26] T-H. Hubert Chan and Anupam Gupta. Small hop-diameter sparse spanners for doubling metrics. In SODA ’06: Proceedings of the seventeenth annual ACM- SIAM symposium on Discrete algorithm, pages 70–78, 2006.

[27] Timothy M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC’07), pages 590–598, 2007.

[28] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.

*********

4