{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:44:46Z","timestamp":1725979486370},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319928708"},{"type":"electronic","value":"9783319928715"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-92871-5_1","type":"book-chapter","created":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T09:51:15Z","timestamp":1527587475000},"page":"1-15","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs"],"prefix":"10.1007","author":[{"given":"Ellen","family":"Cardinaels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johan S. H.","family":"van Leeuwaarden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clara","family":"Stegehuis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,30]]},"reference":[{"issue":"6749","key":"1_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1038\/43601","volume":"401","author":"R Albert","year":"1999","unstructured":"Albert, R., Jeong, H., Barab\u00e1si, A.L.: Internet: diameter of the world-wide web. Nature 401(6749), 130\u2013131 (1999)","journal-title":"Nature"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"036112","DOI":"10.1103\/PhysRevE.68.036112","volume":"68","author":"M Bogu\u00f1\u00e1","year":"2003","unstructured":"Bogu\u00f1\u00e1, M., Pastor-Satorras, R.: Class of correlated random networks with hidden variables. Phys. Rev. E 68, 036112 (2003)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/rsa.20168","volume":"31","author":"B Bollob\u00e1s","year":"2007","unstructured":"Bollob\u00e1s, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random Struct. Algorithms 31(1), 3\u2013122 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Brach, P., Cygan, M., \u0141acki, J., Sankowski, P.: Algorithmic complexity of power law networks. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 1306\u20131325. Society for Industrial and Applied Mathematics, Philadelphia (2016)","DOI":"10.1137\/1.9781611974331.ch91"},{"issue":"6","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1007\/s10955-006-9168-x","volume":"124","author":"T Britton","year":"2006","unstructured":"Britton, T., Deijfen, M., Martin-L\u00f6f, A.: Generating simple random graphs with prescribed degree distribution. J. Stat. Phys. 124(6), 1377\u20131397 (2006)","journal-title":"J. Stat. Phys."},{"issue":"25","key":"1_CR6","doi-asserted-by":"publisher","first-page":"15879","DOI":"10.1073\/pnas.252631999","volume":"99","author":"F. Chung","year":"2002","unstructured":"Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Proc. Natl. Acad. Sci. USA 99(25), 15879\u201315882 (2002) (electronic)","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset, A., Shalizi, C.R., Newman, M.E.J.: Power-law distributions in empirical data. SIAM Rev. 51(4), 661\u2013703 (2009)","journal-title":"SIAM Rev."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/316194.316229","volume":"29","author":"M Faloutsos","year":"1999","unstructured":"Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. ACM SIGCOMM Comput. Commun. Rev. 29, 251\u2013262 (1999)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Friedrich, T., Hermelin, D.: On the average-case complexity of parameterized clique. arXiv:1410.6400v1 (2014)","DOI":"10.1016\/j.tcs.2015.01.042"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.tcs.2015.01.042","volume":"576","author":"N Fountoulakis","year":"2015","unstructured":"Fountoulakis, N., Friedrich, T., Hermelin, D.: On the average-case complexity of parameterized clique. Theor. Comput. Sci. 576, 18\u201329 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Friedrich, T., Krohmer, A.: Cliques in hyperbolic random graphs. In: INFOCOM Proceedings 2015, pp. 1544\u20131552. IEEE (2015)","DOI":"10.1109\/INFOCOM.2015.7218533"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.dam.2014.10.018","volume":"184","author":"T Friedrich","year":"2015","unstructured":"Friedrich, T., Krohmer, A.: Parameterized clique on inhomogeneous random graphs. Disc. Appl. Math. 184, 130\u2013138 (2015)","journal-title":"Disc. Appl. Math."},{"key":"1_CR13","unstructured":"Garey, M.R., Johnson, D.S., Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W H FREEMAN & CO (2011)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Grochow, J.A., Kellis, M.: Network motif discovery using subgraph enumeration and symmetry-breaking. In. RECOMB, pp. 92\u2013106 (2007)","DOI":"10.1007\/978-3-540-71681-5_7"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Heydari, H., Taheri, S.M.: Distributed maximal independent set on inhomogeneous random graphs. In: 2017 2nd Conference on Swarm Intelligence and Evolutionary Computation (CSIEC). IEEE, March 2017","DOI":"10.1109\/CSIEC.2017.7940152"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/9781316779422","volume-title":"Random Graphs and Complex Networks","author":"R Hofstad van der","year":"2017","unstructured":"van der Hofstad, R.: Random Graphs and Complex Networks, vol. 1. Cambridge University Press, Cambridge (2017)"},{"key":"1_CR17","unstructured":"van der Hofstad, R., van Leeuwaarden, J.S.H., Stegehuis, C.: Optimal subgraph structures in scale-free networks. arXiv:1709.03466 (2017)"},{"issue":"04","key":"1_CR18","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.1239\/jap\/1294170524","volume":"47","author":"S Janson","year":"2010","unstructured":"Janson, S., \u0141uczak, T., Norros, I.: Large cliques in a power-law random graph. J. Appl. Probab. 47(04), 1124\u20131135 (2010)","journal-title":"J. Appl. Probab."},{"issue":"6804","key":"1_CR19","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1038\/35036627","volume":"407","author":"H Jeong","year":"2000","unstructured":"Jeong, H., Tombor, B., Albert, R., Oltvai, Z.N., Barab\u00e1si, A.L.: The large-scale organization of metabolic networks. Nature 407(6804), 651\u2013654 (2000)","journal-title":"Nature"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"11","key":"1_CR21","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan, N., Itzkovitz, S., Milo, R., Alon, U.: Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics 20(11), 1746\u20131758 (2004)","journal-title":"Bioinformatics"},{"key":"1_CR22","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection (2014). http:\/\/snap.stanford.edu\/data . Accessed 14 Mar 2017"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-642-25093-4_14","volume-title":"The Semantic Web \u2013 ISWC 2011","author":"X Niu","year":"2011","unstructured":"Niu, X., Sun, X., Wang, H., Rong, S., Qi, G., Yu, Y.: Zhishi.me - weaving chinese linking open data. In: Aroyo, L., Welty, C., Alani, H., Taylor, J., Bernstein, A., Kagal, L., Noy, N., Blomqvist, E. (eds.) ISWC 2011. LNCS, vol. 7032, pp. 205\u2013220. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25093-4_14"},{"issue":"01","key":"1_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1017\/S000186780000080X","volume":"38","author":"I Norros","year":"2006","unstructured":"Norros, I., Reittu, H.: On a conditionally poissonian graph process. Adv. Appl. Probab. 38(01), 59\u201375 (2006)","journal-title":"Adv. Appl. Probab."},{"issue":"5","key":"1_CR25","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1266\/ggs.84.385","volume":"84","author":"S Omidi","year":"2009","unstructured":"Omidi, S., Schreiber, F., Masoudi-Nejad, A.: MODA: an efficient algorithm for network motif discovery in biological networks. Genes Genetic Syst. 84(5), 385\u2013395 (2009)","journal-title":"Genes Genetic Syst."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"066117","DOI":"10.1103\/PhysRevE.70.066117","volume":"70","author":"J Park","year":"2004","unstructured":"Park, J., Newman, M.E.J.: Statistical mechanics of networks. Phys. Rev. E 70, 066117 (2004)","journal-title":"Phys. Rev. E"},{"issue":"17","key":"1_CR27","doi-asserted-by":"publisher","first-page":"3572","DOI":"10.1093\/bioinformatics\/bti556","volume":"21","author":"F Schreiber","year":"2005","unstructured":"Schreiber, F., Schwobbermeyer, H.: MAVisto: a tool for the exploration of network motifs. Bioinformatics 21(17), 3572\u20133574 (2005)","journal-title":"Bioinformatics"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"066130","DOI":"10.1103\/PhysRevE.65.066130","volume":"65","author":"A V\u00e1zquez","year":"2002","unstructured":"V\u00e1zquez, A., Pastor-Satorras, R., Vespignani, A.: Large-scale topological and dynamical properties of the internet. Phys. Rev. E 65, 066130 (2002)","journal-title":"Phys. Rev. E"},{"key":"1_CR29","first-page":"1671","volume-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Virginia Vassilevska Williams","year":"2014","unstructured":"Williams, V.V., Wang, J.R., Williams, R., Yu, H.: Finding four-node subgraphs in triangle time. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 1671\u20131680. Society for Industrial and Applied Mathematics, Philadelphia (2015)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92871-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T19:07:48Z","timestamp":1571425668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92871-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319928708","9783319928715"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92871-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}