{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:07:01Z","timestamp":1761844021924,"version":"3.40.3"},"publisher-location":"Boston","reference-count":118,"publisher":"Birkh\u00e4user Boston","isbn-type":[{"type":"print","value":"9780817647889"},{"type":"electronic","value":"9780817647896"}],"license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-0-8176-4789-6_1","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:42:50Z","timestamp":1287042170000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Brief Introduction to Complex Networks and Their Analysis"],"prefix":"10.1007","author":[{"given":"Frank","family":"Emmert-Streib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"1_CR1_1","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1126\/science.287.5461.2115a","volume":"287","author":"L Adamic","year":"2000","unstructured":"Adamic L, Huberman B (2000) Power-law distribution of the world wide web. Science 287:2115","journal-title":"Science"},{"key":"1_CR2_1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barabasi AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47","journal-title":"Rev Mod Phys"},{"volume-title":"Predicting structured data","year":"2007","key":"1_CR3_1","unstructured":"Bakir GH, Hofmann T, Sch\u00f6lkopf B, Smola AJ, Taskar B, Vishwanathan SVN (eds) (2007) Predicting structured data. MIT Press, Cambridge, MA"},{"key":"1_CR4_1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"206","author":"AL Barabasi","year":"1999","unstructured":"Barabasi AL, Albert R (1999) Emergence of scaling in random networks. Science 206: 509\u2013512","journal-title":"Science"},{"key":"1_CR5_1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","volume":"7","author":"A Bavelas","year":"1948","unstructured":"Bavelas A (1948) A mathematical model for group structure. Hum Organ 7:16\u201330","journal-title":"Hum Organ"},{"key":"1_CR6_1","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1121\/1.1906679","volume":"22","author":"A Bavelas","year":"1950","unstructured":"Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22: 725\u2013730","journal-title":"J Acoust Soc Am"},{"key":"1_CR7_1","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. International Series. Princeton University Press, Princeton, NJ"},{"key":"1_CR8_1","first-page":"65","volume":"7","author":"D Bonchev","year":"1979","unstructured":"Bonchev D (1979) Information indices for atoms and molecules. Match 7:65\u2013113","journal-title":"Match"},{"key":"1_CR9_1","volume-title":"Information theoretic indices for characterization of chemical structures","author":"D Bonchev","year":"1983","unstructured":"Bonchev D (1983) Information theoretic indices for characterization of chemical structures. Research Studies Press, Chichester"},{"key":"1_CR10_1","first-page":"567","volume":"28","author":"D Bonchev","year":"1995","unstructured":"Bonchev D (1995) Kolmogorov\u2019s information, shannon\u2019s entropy, and topological complexity of molecules. Bulg Chem Commun 28:567\u2013582","journal-title":"Bulg Chem Commun"},{"key":"1_CR11_1","doi-asserted-by":"crossref","DOI":"10.1201\/9781482288247","volume-title":"Complexity in chemistry. Introduction and fundamentals. Taylor & Francis, London","author":"D Bonchev","year":"2003","unstructured":"Bonchev D (2003) Complexity in chemistry. Introduction and fundamentals. Taylor & Francis, London (Philadelphia, PA)"},{"key":"1_CR12_1","doi-asserted-by":"publisher","DOI":"10.1007\/b136300","volume-title":"Complexity in chemistry, biology, and ecology","author":"D Bonchev","year":"2005","unstructured":"Bonchev D, Rouvray DH (2005) Complexity in chemistry, biology, and ecology. Mathematical and computational chemistry. Springer, Berlin"},{"key":"1_CR13_1","doi-asserted-by":"publisher","first-page":"4517","DOI":"10.1063\/1.434593","volume":"67","author":"D Bonchev","year":"1977","unstructured":"Bonchev D, Trinajsti\u0107 N (1977) Information theory, distance matrix and molecular branching. J Chem Phys 67:4517\u20134533","journal-title":"J Chem Phys"},{"issue":"2","key":"1_CR14_1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1021\/ci60022a011","volume":"20","author":"D Bonchev","year":"1980","unstructured":"Bonchev D, Balaban AT, Mekenyan OG (1980) Generalization of the graph center concept, and derived topological centric indexes. J Chem Inf Comput Sci 20(2):106\u2013113","journal-title":"J Chem Inf Comput Sci"},{"key":"1_CR15_1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","volume":"2","author":"P Bonacich","year":"1972","unstructured":"Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2:113\u2013120","journal-title":"J Math Sociol"},{"key":"1_CR16_1","volume-title":"Handbook of graphs and networks: from the genome to the internet","author":"S Bornholdt","year":"2003","unstructured":"Bornholdt S, Schuster HG (2003) Handbook of graphs and networks: from the genome to the internet. Wiley, New York, NY"},{"volume-title":"Handbook of graphs and networks: from the genome to the internet","year":"2003","key":"1_CR17_1","unstructured":"Bornholdt S, Schuster HG (eds) (2003) Handbook of graphs and networks: from the genome to the internet. Wiley, New York, NY"},{"issue":"2","key":"1_CR18_1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. J Math Sociol 25(2):163\u2013177","journal-title":"J Math Sociol"},{"key":"1_CR19_1","doi-asserted-by":"publisher","DOI":"10.1007\/b106453","volume-title":"Network analysis","author":"U Brandes","year":"2005","unstructured":"Brandes U, Erlebach T (2005) Network analysis. Lecture notes in computer science. Springer, Berlin"},{"key":"1_CR20_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes","author":"A Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt A, Le VB, Sprinrand JP (1999) Graph classes. A survey. SIAM Monographs on Discrete Mathematics and Applications"},{"key":"1_CR21_1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-31955-9_11","volume-title":"Network analysis","author":"M Brinkmeier","year":"2005","unstructured":"Brinkmeier M, Schank T (2005) Network statistics. In Brandes U, Erlebach T (eds) Network analysis. Lecture notes in computer science. Springer, Berlin, pp 293\u2013317"},{"key":"1_CR22_1","doi-asserted-by":"crossref","unstructured":"Broder A, Kumar R, Maghoul F, Raghavan P, Rajagopalan S, Stata R, Tomkins A, Wiener J (2000) Graph structure in the web: experiments and models. In: Proceedings of the 9th WWW conference, Amsterdam","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"1_CR23_1","volume-title":"Distance in graphs","author":"F Buckley","year":"1990","unstructured":"Buckley F, Harary F (1990) Distance in graphs. Addison-Wesley, Reading, MA"},{"key":"1_CR24_1","first-page":"35","volume":"20","author":"H Bunke","year":"1983","unstructured":"Bunke H (1983) What is the distance between graphs? Bull EATCS 20:35\u201339","journal-title":"Bull EATCS"},{"issue":"9","key":"1_CR25_1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H Bunke","year":"1997","unstructured":"Bunke H (1997) On a relation between graph edit distance and maximum common subgraph. Pattern Recognit Lett 18(9):689\u2013694","journal-title":"Pattern Recognit Lett"},{"issue":"3","key":"1_CR26_1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke H (1998) A graph distance metric based on the maximum common subgraph. Pattern Recognit Lett 19(3):255\u2013259","journal-title":"Pattern Recognit Lett"},{"key":"1_CR27_1","unstructured":"Bunke H, Allermann G (1983) A metric on graphs for structural pattern recognition. In: Schussler HW (ed) Proceedings of 2nd European signal processing conference EUSIPCO, pp 257\u2013260"},{"key":"1_CR28_1","first-page":"17","volume-title":"Mining graph data","author":"H Bunke","year":"2007","unstructured":"Bunke H, Neuhaus M (2007) Graph matching. Exact and error-tolerant methods and the automatic learning of edit costs. In: Cook D, Holder LB (eds) Mining graph data. Wiley, New York, NY, pp 17\u201332"},{"issue":"8\u201313","key":"1_CR29_1","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1016\/S0169-7552(97)00062-7","volume":"29","author":"SJ Carri\u00e8re","year":"1997","unstructured":"Carri\u00e8re SJ, Kazman R (1997) Webquery: searching and visualizing the web through connectivity. Computer Networks and ISDN Systems 29(8\u201313):1257\u20131267","journal-title":"Computer Networks and ISDN Systems"},{"key":"1_CR30_1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/14786445708642238","volume":"13","author":"A Cayley","year":"1857","unstructured":"Cayley A (1857) On the theory of analytic forms called trees. Philos Mag 13:19\u201330","journal-title":"Philos Mag"},{"key":"1_CR31_1","unstructured":"Cayley A (1875) On the analytical forms called trees, with application to the theory of chemical combinatorics. Report of the British Association for the Advancement of Science, pp 257\u2013305"},{"key":"1_CR32_1","doi-asserted-by":"publisher","DOI":"10.1002\/3527603158","volume-title":"Principles of equilibrium statistical mechanics","author":"D Chowdhury","year":"2000","unstructured":"Chowdhury D, Stauffer D (2000) Principles of equilibrium statistical mechanics. Wiley-VCH, Weinheim"},{"key":"1_CR33_1","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70:066111","journal-title":"Phys Rev E"},{"key":"1_CR34_1","first-page":"321","volume":"365\u2013373","author":"JC Claussen","year":"2007","unstructured":"Claussen JC (2007) Characterization of networks by the offdiagonal complexity. Physica A 365\u2013373:321\u2013354","journal-title":"Physica A"},{"key":"1_CR35_1","unstructured":"Claussen JC (2007) Offdiagonal complexity: a computationally quick network complexity measure \u2013 application to protein networks and cell division. In: Deutsch A, Bravo de la Parra R et al (eds) Mathematical modeling of biological systems, vol II. Birkh\u00e4user, Boston, MA, pp 303\u2013311"},{"key":"1_CR36_1","volume-title":"Mining graph data","author":"D Cook","year":"2007","unstructured":"Cook D, Holder LB (2007) Mining graph data. Wiley, New York, NY"},{"key":"1_CR37_1","volume-title":"Introduction to algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen T, Leiserson CE, Rivest RL, Leiserson C, Rivest R (2001) Introduction to algorithms. MIT Press, Cambridge, MA"},{"key":"1_CR38_1","volume-title":"An introduction to support vector machines","author":"N Cristianini","year":"2000","unstructured":"Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines. Cambridge University Press, Cambridge"},{"key":"1_CR39_1","volume-title":"Strukturelle Analyse web-basierter Dokumente","author":"M Dehmer","year":"2006","unstructured":"Dehmer M (2006) Strukturelle Analyse web-basierter Dokumente. Multimedia und Telekooperation. Deutscher Universit\u00e4ts Verlag, Wiesbaden"},{"key":"1_CR40_1","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1080\/01969720802435925","volume":"39","author":"M Dehmer","year":"2008","unstructured":"Dehmer M (2008) A novel method for measuring the structural information content of networks. Cybern Syst 39:825\u2013842","journal-title":"Cybern Syst"},{"key":"1_CR41_1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1515\/zna-2008-3-407","volume":"63a","author":"M Dehmer","year":"2008","unstructured":"Dehmer M, Emmert-Streib F (2008) Structural information content of chemical networks. Zeitschrift f\u00fcr Naturforschung, Part A 63a:155\u2013159","journal-title":"Zeitschrift f\u00fcr Naturforschung, Part A"},{"key":"1_CR42_1","volume-title":"World wide web: a graph-theoretic perspective","author":"N Deo","year":"2001","unstructured":"Deo N, Gupta P (2001) World wide web: a graph-theoretic perspective. Technical report, Department of Computer Science, University of Central Florida"},{"key":"1_CR43_1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10044-004-0222-5","volume":"7","author":"PJ Dickinson","year":"2004","unstructured":"Dickinson PJ, Bunke H, Dadej A, Kraetzl M (2004) Matching graphs with unique node labels. Pattern Anal Appl 7:243\u2013266","journal-title":"Pattern Anal Appl"},{"key":"1_CR44_1","volume-title":"Graph theory","author":"R Diestel","year":"2000","unstructured":"Diestel R (2000) Graph theory. Springer, Berlin"},{"key":"1_CR45_1","doi-asserted-by":"publisher","first-page":"027104","DOI":"10.1103\/PhysRevE.72.027104","volume":"72","author":"J Duch","year":"2005","unstructured":"Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E, 72:027104","journal-title":"Phys Rev E"},{"issue":"7","key":"1_CR46_1","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1089\/cmb.2007.0041","volume":"14","author":"F Emmert-Streib","year":"2007","unstructured":"Emmert-Streib F (2007) The chronic fatigue syndrome: a comparative pathway analysis. J Comput Biol 14(7):961\u2013972","journal-title":"J Comput Biol"},{"key":"1_CR47_1","unstructured":"Emmert-Streib F, Chen L, Storey J (2007) Functional annotation of genes in Saccharomyces cerevisiae based on joint betweenness. arXiv:0709.3291"},{"key":"1_CR48_1","first-page":"326","volume":"4610138","author":"Emmert-Streib F, Dehmer M (2007) Global information processing in gene networks: fault tolerance. In: Proceedings of the bio-inspired models of network, information, and computing systems, Bionetics","year":"2007","unstructured":"Emmert-Streib F, Dehmer M (2007) Global information processing in gene networks: fault tolerance. In: Proceedings of the bio-inspired models of network, information, and computing systems, Bionetics 2007, art. no. 4610138, pp 326\u2013329","journal-title":"no."},{"key":"1_CR49_1","unstructured":"Emmert-Streib F, Dehmer M, Kilian J (2005) Classification of large graphs by a local tree decomposition. In: Arabnia HR, Scime A (eds) Proceedings of DMIN\u201905, international conference on data mining, Las Vegas, June 20\u201323, pp 200\u2013207"},{"issue":"2","key":"1_CR50_1","doi-asserted-by":"publisher","first-page":"1326","DOI":"10.1016\/j.amc.2006.07.162","volume":"186","author":"F Emmert-Streib","year":"2007","unstructured":"Emmert-Streib F, Dehmer M (2007) Topolocial mappings between graphs, trees and generalized trees. Appl Math Comput 186(2):1326\u20131333","journal-title":"Appl Math Comput"},{"volume-title":"Analysis of microarray data: a network based approach","year":"2008","key":"1_CR51_1","unstructured":"Emmert-Streib F, Dehmer M (eds) (2008) Analysis of microarray data: a network based approach. Wiley-VCH, Weinheim"},{"issue":"5","key":"1_CR52_1","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1142\/S0129183108012510","volume":"19","author":"F Emmert-Streib","year":"2005","unstructured":"Emmert-Streib F, Dehmer M (2005) Robustness in scale-free networks: comparing directed and undirected networks. Int J Mod Phys C 19(5):717\u2013726","journal-title":"Int J Mod Phys C"},{"key":"1_CR53_1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1186\/1471-2105-8-237","volume":"8","author":"F Emmert-Streib","year":"2007","unstructured":"Emmert-Streib F, Mushegian A (2007) A topological algorithm for identification of structural domains of proteins. BMC Bioinformatics 8:237","journal-title":"BMC Bioinformatics"},{"key":"1_CR54_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1959) On random graphs. Publicationes Mathematicae 6:290\u2013297","journal-title":"Publicationes Mathematicae"},{"key":"1_CR55_1","first-page":"17","volume":"5","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s P, R\u00e9nyi A (1960) On the evolution of random graphs. Publications of Mathematical Institute of the Hungarian Academy of Sciences 5:17\u201361","journal-title":"Publications of Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"1_CR56_1","first-page":"128","volume":"8","author":"L Euler","year":"1736","unstructured":"Euler L (1736) Solutio problematis ad geometriam situs pertinentis. Comentarii Academiae Scientiarum Imperialis Petropolitanae 8:128\u2013140","journal-title":"Comentarii Academiae Scientiarum Imperialis Petropolitanae"},{"key":"1_CR57_1","volume-title":"Algorithms","author":"S Even","year":"1979","unstructured":"Even S (1979) Algorithms. Computer Science Press, Potomac, MD"},{"key":"1_CR58_1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40: 35\u201341","journal-title":"Sociometry"},{"key":"1_CR59_1","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1979","unstructured":"Freeman LC (1979) Centrality in social networks: conceptual clarification. Soc Networks 1:215\u2013239","journal-title":"Soc Networks"},{"issue":"1","key":"1_CR60_1","first-page":"63","volume":"6","author":"JI Fujii","year":"1997","unstructured":"Fujii JI, Yuki S (1997) Entropy and coding for graphs. Int J Math Stat Sci 6(1):63\u201377","journal-title":"Int J Math Stat Sci"},{"key":"1_CR61_1","doi-asserted-by":"publisher","first-page":"R57","DOI":"10.1186\/gb-2004-5-8-r57","volume":"5","author":"J Gagneur","year":"2004","unstructured":"Gagneur J, Krause R, Bouwmeester T, Casari G (2004) Modular decomposition of protein\u2013protein interaction networks. Genome Biol 5:R57","journal-title":"Genome Biol"},{"key":"1_CR62_1","first-page":"129","volume-title":"On graph kernels: hardness results and efficient alternatives","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner T, Flach PA, Wrobel S (2003) On graph kernels: hardness results and efficient alternatives. In: COLT, pp 129\u2013143"},{"key":"1_CR63_1","first-page":"3","volume":"7","author":"D Gernert","year":"1979","unstructured":"Gernert D (1979) Measuring the similarity of complex structures by means of graph grammars. Bull EATCS 7:3\u20139","journal-title":"Bull EATCS"},{"key":"1_CR64_1","first-page":"13","volume":"13","author":"D Gernert","year":"1981","unstructured":"Gernert D (1981) Graph grammars which generate graphs with specified properties. Bull EATCS 13:13\u201320","journal-title":"Bull EATCS"},{"issue":"4","key":"1_CR65_1","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0219525903001067","volume":"6","author":"PM Gleiser","year":"2003","unstructured":"Gleiser PM, Danon L (2003) Community structure in jazz. Advances in complex systems 6(4):565\u2013574","journal-title":"Advances in complex systems"},{"key":"1_CR66_1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0378-8733(94)00248-9","volume":"17","author":"P Hage","year":"1995","unstructured":"Hage P, Harary F (1995) Eccentricity and centrality in networks. Soc Networks 17:57\u201363","journal-title":"Soc Networks"},{"key":"1_CR67_1","doi-asserted-by":"crossref","DOI":"10.1515\/9783112471401","volume-title":"Graphentheorie","author":"R Halin","year":"1989","unstructured":"Halin R (1989) Graphentheorie. Akademie Verlag, Berlin"},{"key":"1_CR68_1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.2307\/2785610","volume":"22","author":"F Harary","year":"1959","unstructured":"Harary F (1959) Status and contrastatus. Sociometry 22:23\u201343","journal-title":"Sociometry"},{"key":"1_CR69_1","volume-title":"Structural models","author":"F Harary","year":"1965","unstructured":"Harary F (1965) Structural models. An introduction to the theory of directed graphs. Wiley, NY"},{"key":"1_CR70_1","volume-title":"Graph theory and theoretical physics","author":"F Harary","year":"1967","unstructured":"Harary F (1967) Graph theory and theoretical physics. Academic, New York, NY"},{"key":"1_CR71_1","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley, Reading, MA"},{"key":"1_CR72_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The elements of statistical learning","author":"T Hastie","year":"2001","unstructured":"Hastie T, Tibshirani R, Friedman JH (2001) The elements of statistical learning. Springer, Berlin"},{"key":"1_CR73_1","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th T, G\u00e4rtner T, Wrobel S (2004) Cyclic pattern kernels for predictive graph mining. In: Proceedings of the 2004 ACM SIGKDD international conference on knowledge discovery and data mining, pp 158\u2013167","DOI":"10.1145\/1014052.1014072"},{"issue":"3","key":"1_CR74_1","doi-asserted-by":"publisher","first-page":"037703","DOI":"10.1103\/PhysRevE.68.037703","volume":"68","author":"H-P Hsu","year":"2003","unstructured":"Hsu H-P, Mehra V, Grassberger P (2003) Structure optimization in an off-lattice protein model. Phys Rev E 68(3):037703","journal-title":"Phys Rev E"},{"issue":"82","key":"1_CR75_1","first-page":"1","volume":"2","author":"F Kaden","year":"1982","unstructured":"Kaden F (1982) Graphmetriken und Distanzgraphen. ZKI-Informationen, Akademie der Wissenschaften DDR 2(82):1\u201363","journal-title":"ZKI-Informationen, Akademie der Wissenschaften DDR"},{"key":"1_CR76_1","first-page":"92","volume-title":"Halbgeordnete Graphmengen und Graphmetriken","author":"F Kaden","year":"1983","unstructured":"Kaden F (1983) Halbgeordnete Graphmengen und Graphmetriken. In: Proceedings of the conference graphs, hypergraphs, and applications DDR, pp 92\u201395"},{"key":"1_CR77_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1515\/9783112753378","volume-title":"Graphmetriken und Isometrieprobleme zugeh\u00f6riger Distanzgraphen","author":"F Kaden","year":"1986","unstructured":"Kaden F (1986) Graphmetriken und Isometrieprobleme zugeh\u00f6riger Distanzgraphen. ZKI-Informationen, Akademie der Wissenschaften DDR, pp 1\u2013100"},{"key":"1_CR78_1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"SA Kauffman","year":"1969","unstructured":"Kauffman SA (1969) Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol 22:437\u2013467","journal-title":"J Theor Biol"},{"key":"1_CR79_1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1090\/S1079-6762-97-00018-8","volume":"3","author":"J Kieffer","year":"1997","unstructured":"Kieffer J, Yang E (1997) Ergodic behavior of graph entropy. Electronic Research Announcements of the American Mathematical Society 3:11\u201316","journal-title":"Electronic Research Announcements of the American Mathematical Society"},{"key":"1_CR80_1","unstructured":"Kondor RI, Lafferty J (2002) Diffusion kernels on graphs and other discrete input spaces. In: Machine learning: Proceedings of the 19th international conference, Morgan Kaufmann, San Mateo, CA"},{"key":"1_CR81_1","volume-title":"Theorie der endlichen und unendlichen Graphen","author":"D K\u00f6nig","year":"1936","unstructured":"K\u00f6nig D (1936) Theorie der endlichen und unendlichen Graphen. Chelsea, New York, NY"},{"key":"1_CR82_1","unstructured":"K\u00f6rner J (1973) Coding of an information source having ambiguous alphabet and the entropy of graphs. Transactions of the 6th Prague conference on information theory, pp 411\u2013425"},{"key":"1_CR83_1","first-page":"16","volume-title":"Centrality indices","author":"D Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki D, Lehmann KA, Peters L, Richter S, Tenfelde-Podehl D, Zlotkowski O (2005) Clustering. In: Brandes U, Erlebach T (eds) Centrality indices. Lecture notes in computer science. Springer, Berlin, pp 16\u201361"},{"key":"1_CR84_1","volume-title":"Information theory and statistics","author":"S Kullback","year":"1959","unstructured":"Kullback S (1959) Information theory and statistics. Wiley, New York, NY"},{"issue":"1","key":"1_CR85_1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","journal-title":"Ann Math Stat"},{"key":"1_CR86_1","doi-asserted-by":"crossref","DOI":"10.1090\/psapm\/064","volume-title":"Modeling and simulation of biological networks","author":"RC Laubenbacher","year":"2007","unstructured":"Laubenbacher RC (2007) Modeling and simulation of biological networks. In: Proceedings of symposia in applied mathematics. American Mathematical Society, Providence, RI"},{"key":"1_CR87_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M Li","year":"1997","unstructured":"Li M, Vit\u00e1nyi P (1997) An introduction to Kolmogorov complexity and its applications. Springer, Berlin"},{"issue":"2","key":"1_CR88_1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1049\/iet-syb:20060038","volume":"1","author":"O Mason","year":"2007","unstructured":"Mason O, Verwoerd M (2007) Graph theory and networks in biology. IET Syst Biol 1(2): 89\u2013119","journal-title":"IET Syst Biol"},{"key":"1_CR89_1","first-page":"496","volume-title":"international conference on bioinformatics & computational biology (BIOCOMP\u201906), 2006","author":"Mehler A (2006) In search of a bridge between network analysis in computational linguistics and computational biology \u2013 a conceptual note. In: Proceedings of the","year":"2006","unstructured":"Mehler A (2006) In search of a bridge between network analysis in computational linguistics and computational biology \u2013 a conceptual note. In: Proceedings of the 2006 international conference on bioinformatics & computational biology (BIOCOMP\u201906), 2006, Las Vegas, Nevada, USA, pp 496\u2013500"},{"key":"1_CR90_1","doi-asserted-by":"crossref","unstructured":"Mehler A, Dehmer M, Gleim R (2005) Towards logical hypertext structure. a graph-theoretic perspective. In: Proceedings of I2CS\u201904. Lecture notes. Springer, Berlin, pp 136\u2013150","DOI":"10.1007\/11553762_14"},{"issue":"5","key":"1_CR91_1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"BT Messmer","year":"1998","unstructured":"Messmer BT, Bunke H (1998) A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans Pattern Anal Mach Intell 20(5):493\u2013504","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1_CR92_1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02476948","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz A (1968) Entropy and the complexity of the graphs I: an index of the relative complexity of a graph. Bull Math Biophys 30:175\u2013204","journal-title":"Bull Math Biophys"},{"key":"1_CR93_1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF02476692","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz A (1968) Entropy and the complexity of graphs II: the information content of digraphs and infinite graphs. Bull Math Biophys 30:225\u2013240","journal-title":"Bull Math Biophys"},{"key":"1_CR94_1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02476603","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz A (1968) Entropy and the complexity of graphs III: graphs with prescribed information content. Bull Math Biophys 30:387\u2013414","journal-title":"Bull Math Biophys"},{"key":"1_CR95_1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BF02476673","volume":"30","author":"A Mowshowitz","year":"1968","unstructured":"Mowshowitz A (1968) Entropy and the complexity of graphs IV: entropy measures and graphical structure. Bull Math Biophys 30:533\u2013546","journal-title":"Bull Math Biophys"},{"key":"1_CR96_1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Rev 45: 167\u2013256","journal-title":"SIAM Rev"},{"key":"1_CR97_1","doi-asserted-by":"publisher","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structures in networks. Phys Rev E 69:026113","journal-title":"Phys Rev E"},{"key":"1_CR98_1","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577\u20138582","journal-title":"Proc Natl Acad Sci USA"},{"key":"1_CR99_1","volume-title":"Probabilistic reasoning in intelligent systems","author":"J Pearl","year":"1998","unstructured":"Pearl J (1998) Probabilistic reasoning in intelligent systems. Morgan Kaufmann, Los Altos, CA"},{"key":"1_CR100_1","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF02477860","volume":"17","author":"N Rashewsky","year":"1955","unstructured":"Rashewsky N (1955) Life, information theory, and topology. Bull Math Biophys 17:229\u2013235","journal-title":"Bull Math Biophys"},{"key":"1_CR101_1","volume-title":"Applications of combinatorics and graph theory to the biological and social sciences series","author":"F Roberts","year":"1989","unstructured":"Roberts F (1989) Applications of combinatorics and graph theory to the biological and social sciences series. IMA volumes in mathematics and its applications. Springer, Berlin"},{"issue":"18","key":"1_CR102_1","doi-asserted-by":"publisher","first-page":"7327","DOI":"10.1073\/pnas.0611034104","volume":"104","author":"M Rosvall","year":"2007","unstructured":"Rosvall M, Bergstrom CT (2007) An information-theoretic framework for resolving community structure in complex networks. In: Proc Natl Acad Sci USA 104(18):7327\u201331","journal-title":"Proc Natl Acad Sci USA"},{"key":"1_CR103_1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02289527","volume":"31","author":"G Sabidussi","year":"1966","unstructured":"Sabidussi G (1966) The centrality index of a graph. Psychometrika 31:581\u2013603","journal-title":"Psychometrika"},{"key":"1_CR104_1","volume-title":"Social network analysis","author":"F Scott","year":"2001","unstructured":"Scott F (2001) Social network analysis. Sage, Beverly Hills, CA"},{"key":"1_CR105_1","volume-title":"The mathematical theory of communication","author":"CE Shannon","year":"1997","unstructured":"Shannon CE, Weaver W (1997) The mathematical theory of communication. University of Illinois Press, Champaign, IL"},{"key":"1_CR106_1","first-page":"293","volume-title":"Perfect graphs","author":"G Simonyi","year":"2001","unstructured":"Simonyi G (2001) Perfect graphs and graph entropy. An updated survey. In: Ramirez-Alfonsin J, Reed B (eds) Perfect graphs. Wiley, New York, NY, pp 293\u2013328"},{"key":"1_CR107_1","first-page":"105","volume":"23","author":"VA Skorobogatov","year":"1988","unstructured":"Skorobogatov VA, Dobrynin AA (1988) Metrical analysis of graphs. MATCH 23:105\u2013155","journal-title":"MATCH"},{"issue":"82","key":"1_CR108_1","first-page":"63","volume":"2","author":"F Sobik","year":"1982","unstructured":"Sobik F (1982) Graphmetriken und Klassifikation strukturierter Objekte. ZKI-Informationen, Akademie der Wissenschaften DDR 2(82):63\u2013122","journal-title":"ZKI-Informationen, Akademie der Wissenschaften DDR"},{"key":"1_CR109_1","first-page":"104","volume":"4","author":"F Sobik","year":"1986","unstructured":"Sobik F (1986) Modellierung von Vergleichsprozessen auf der Grundlage von \u00c4hnlichkeitsma\u00dfen f\u00fcr Graphen. ZKI-Informationen, Akademie der Wissenschaften DDR 4:104\u2013144","journal-title":"ZKI-Informationen, Akademie der Wissenschaften DDR"},{"key":"1_CR110_1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-44485-5_9","volume":"650","author":"RV Sol\u00e9","year":"2004","unstructured":"Sol\u00e9 RV, Valverde S (2004) Information theory of complex networks: on evolution and architectural constraints. In: Lecture notes in physics, vol 650, pp 189\u2013207","journal-title":"Lecture notes in physics, vol"},{"key":"1_CR111_1","volume-title":"Chemical reaction networks","author":"O Temkin","year":"1996","unstructured":"Temkin O, Zeigarnik AV, Bonchev D (1996) Chemical reaction networks. A graph-theoretical approach. CRC Press, West Palm Beach, FL"},{"issue":"2","key":"1_CR112_1","first-page":"129","volume":"18","author":"E Trucco","year":"1956","unstructured":"Trucco E (1956) A note on the information content of graphs. Bull Math Biol 18(2):129\u2013135","journal-title":"Bull Math Biol"},{"issue":"1","key":"1_CR113_1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342","journal-title":"J ACM"},{"key":"1_CR114_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: methods and applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman S, Faust K (1994) Social network analysis: methods and applications. Structural analysis in the social sciences. Cambridge University Press, Cambridge"},{"key":"1_CR115_1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393: 440\u2013442","journal-title":"Nature"},{"key":"1_CR116_1","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1086\/jar.33.4.3629752","volume":"33","author":"W Zachary","year":"1977","unstructured":"Zachary W (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452\u2013473","journal-title":"J Anthropol Res"},{"key":"1_CR117_1","first-page":"371","volume":"100","author":"B Zelinka","year":"1975","unstructured":"Zelinka B (1975) On a certain distance between isomorphism classes of graphs. \u010casopis pro p\u0306est. Mathematiky 100:371\u2013373","journal-title":"Mathematiky"},{"issue":"3","key":"1_CR118_1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang K, Statman R, Shasha D (1992) On the editing distance between unordered labeled trees. Inform Process Lett 42(3):133\u2013139","journal-title":"Inform Process Lett"}],"container-title":["Structural Analysis of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-8176-4789-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T18:55:12Z","timestamp":1740596112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-8176-4789-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"ISBN":["9780817647889","9780817647896"],"references-count":118,"URL":"https:\/\/doi.org\/10.1007\/978-0-8176-4789-6_1","relation":{},"subject":[],"published":{"date-parts":[[2010,9,16]]},"assertion":[{"value":"16 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}