1. H. Bunke, Graph matching: theoretical foundations, algorithms, and applications, in Proceedings of the International Conference on Vision Interface, pp. 82–88, May 2000.
2. V. Kann, On the approximability of the maximum common subgraph problem, in Proceedings of 9th Annual Symposium on Theoretical Aspects of Computer Science, pp. 377–388, 1992.
3. A.J. Seary, W.D. Richards, Spectral methods for analyzing and visualizing networks: an introduction, in Dynamic Social Network Modeling and Analysis, National Academic Press, pp. 209–228, 2003.
4. B. Nadler, S. Lafon, R. Coifman, I. Kevrekidis, Diffusion maps, spectral clustering and eigenfunctions of fokker-planck operators, in Neural Information Processing Systems (NIPS), 2005.
5. A. Ng, M. Jordan, Y. Weiss, On spectral clustering: analysis and an algorithm, in Advances in Neural Information Processing Systems 14 (T. Dietterich, S. Becker, Z. Ghahramani, ed.), MIT Press, 2002.
6. A.G. Thomason, Pseudo-random graphs, Random Graphs ’85, North-Holland Mathematical Study, vol. 144, pp. 307–331, 1987.
7. F.R.K. Chung, R.L. Graham, R.M. Wilson, Quasi-random graphs, Combinatorica, 9(4), 345–362 (1989).
8. F.R.K. Chung, Spectral Graph Theory (CBMS Regional Conference Series in Mathematics), American Mathematical Society, 1997.
9. X. Wang, D. Loguinov, Wealth-based evolution model for the internet as-level topology, in Proceedings of IEEE INFOCOM, April 2006.
10. D. Fay, H. Haddadi, A.G. Thomason, A.W. Moore, R. Mortier, A. Jamakovic, S. Uhlig, M. Rio, Weighted spectral distribution for internet topology analysis: theory and applications, IEEE/ACM Trans. Netw. (ToN), 18(1), 164–176 (2010).
11. R. Albert, A.-L. Barabasi, Topology of evolving networks: local events and universality, Phys. Rev. Lett. 85, 2000.
12. H. Haddadi, D. Fay, A. Jamakovic, O. Maennel, A.W. Moore, R. Mortier, M. Rio, S. Uhlig, Beyond node degree: evaluating AS topology models. Technical Report UCAM-CL-TR-725, University of Cambridge, Computer Laboratory, July 2008.
13. H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, W. Willinger, Network topology generators: degree-based vs. structural, in Proceedings of ACM SIGCOMM 2002, Pittsburgh, PA, pp. 147–159, 2002.
14. P. Mahadevan, D. Krioukov, M. Fomenkov, X. Dimitropoulos, K.C. Claffy, A. Vahdat, The Internet AS-level topology: three data sources and one definitive metric, SIGCOMM Compu. Commun. Rev. 36(1), 17–26 (2006).
15. M.E.J. Newman, Assortative mixing in networks, Phys. Rev. Lett. 89(20), 871–898 (2002).
16. V. Colizza, A. Flammini, M.A. Serrano, A. Vespignani, Detecting rich-club ordering in complex networks, Nat. Phys. 2(2), 110–115 (2006).
17. S. Zhou, Characterising and modelling the Internet topology, the rich-club phenomenon and the PFP model, BT Technol. J. 24 (2006).
18. P. Holme, B.J. Kim, C.N. Yoon, S.K. Han, Attack vulnerability of complex networks. Phys. Rev. E, 65(5), 298–305 (2002).
19. M. Baur, U. Brandes, M. Gaertler, D. Wagner, Drawing the AS graph in 2.5 dimensions, in Graph Drawing (J. Pach, ed.), Springer, New York, pp. 43–48, 2004.
20. D.R. Wood, An algorithm for finding a maximum clique in a graph, Oper. Res. Lett. 21(7), 211–217 (1997).
21. B.M. Waxman, Routing of multipoint connections, IEEE J. Selected Areas Commun. (JSAC), 6(9), 1617–1622 (1988).
22. P. Erdös, A. Rényi, On random graphs, in Mathematical Institute Hungarian Academy, 196, London, 1985.
23. A.L. Barabasi, R. Albert, Emergence of scaling in random networks, Science 286(5439), 509–512 (1999).
24. M. Faloutsos, P. Faloutsos, C. Faloutsos, On power–law relationships of the Internet topology, in Proceedings of ACM SIGCOMM 1999, 1999.
25. T. Bu, D. Towsley, On distinguishing between Internet power–law topology generators, in Proceedings of IEEE Infocom 2002, June 2002.
26. J. Winick, S. Jamin, Inet-3.0: internet topology generator, Technical Report CSE-TR-456-02, University of Michigan Technical Report CSE-TR-456-02, 2002.
27. E.W. Zegura, K.L. Calvert, M.J. Donahoo, A quantitative comparison of graph-based models for Internet topology, IEEE/ACM Trans. Netw. (TON) 5(6), 770–783 (1997).
28. A. Medina, A. Lakhina, I. Matta, J. Byers, BRITE: an approach to universal topology generation, in IEEE MASCOTS, Cincinnati, OH, USA, pp. 346–353, August 2001.
29. A. Feldmann, O. Maennel, Z.M. Mao, A. Berger, B. Maggs, Locating Internet routing instabilities, in Proceedings of ACM SIGCOMM 2004, 2004.
30. Z.M. Mao, J. Rexford, J. Wang, R.H. Katz, Towards an accurate AS-level traceroute tool, in Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, pp. 365–378, 2003.
31. S. Zhou, G.-Q. Zhang, G.-Q. Zhang, Chinese Internet AS-level topology, IET Commun. 1(2), 209–214 (2007).
32. R. Oliveira, B. Zhang, L. Zhang, Observing the evolution of Internet AS topology, in Proceedings of ACM SIGCOMM 2007, Kyoto, Japan, August 2007.
33. P. Mahadevan, D. Krioukov, K. Fall, A. Vahdat, Systematic topology analysis and generation using degree correlations, in Proceedings of ACM SIGCOMM 2006, pp. 135–146, Pisa, Italy, 2006.
34. H. Haddadi, D. Fay, S. Uhlig, A. Moore, R. Mortier, A. Jamakovic, M. Rio, Tuning topology generators using spectral distributions, in Lecture Notes in Computer Science, SPEC International Performance Evaluation Workshop, Springer Darmstadt, Germany, vol. 5119, 2008.
35. A. Banerjee, J. Jost, Spectral plot properties: towards a qualitative classification of networks, in European Conference on Complex Systems, October 2007.
36. J.A. Nelder, R. Mead, A simplex method for function minimization, Comput. J. 7, 308–313 (1965).
37. J.E. Dennis, D.J. Woods, Optimization in microcomputers: the Nelder–Meade simplex algorithm, in New Computing Environments: Microcomputers in Large-Scale Computing (A. Wouk, ed.), SIAM, pp. 116–122, 1987.
38. T. Cox, M. Cox, Multidimensional Scaling, Chapman and Hall, 1994.
39. G.A.F. Seber, Multivariate Observations, John Wiley & Sons, 1984.
40. M. Iliofotou, M. Faloutsos, M. Mitzenmacher, Exploiting dynamicity in graph-based traffic analysis: techniques and applications, in ACM CoNEXT, 2009.
41. H. Haddadi, D. Fay, S. Uhlig, A. Moore, R. Mortier, A. Jamakovic, Mixing biases: structural changes in the AS topology evolution, in Proceedings of the 2nd Traffic Monitoring and Analysis (TMA) Workshop, Zurich, Switzerland, April 2010.