{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:02:44Z","timestamp":1725814964112},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319148021"},{"type":"electronic","value":"9783319148038"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14803-8_30","type":"book-chapter","created":{"date-parts":[[2015,1,9]],"date-time":"2015-01-09T20:03:21Z","timestamp":1420833801000},"page":"387-394","source":"Crossref","is-referenced-by-count":0,"title":["Mechanical Generation of Networks with Surplus Complexity"],"prefix":"10.1007","author":[{"given":"Russell K.","family":"Standish","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Dehmer, M., Mowshowitz, A.: A case study of cracks in the scientific enterprise: Reinvention of information-theoretic measures for graphs. Complexity (2014), doi:10.1002\/cplx.21540","key":"30_CR1","DOI":"10.1002\/cplx.21540"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0167-2789(90)90064-V","volume":"42","author":"C.G. Langton","year":"1990","unstructured":"Langton, C.G.: Computation at the edge of chaos: Phase transitions and emergent computation. Physica D\u00a042, 12\u201337 (1990)","journal-title":"Physica D"},{"doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and its Applications, 2nd edn. Springer (1997)","key":"30_CR3","DOI":"10.1007\/978-1-4757-2606-0"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM Journal on Computing\u00a010(1), 11\u201321 (1981), \n                    \n                      http:\/\/link.aip.org\/link\/?SMJ\/10\/11\/1","journal-title":"SIAM Journal on Computing"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"239","DOI":"10.3354\/meps161239","volume":"161","author":"M. Monaco","year":"1997","unstructured":"Monaco, M., Ulanowicz, R.: Comparative ecosystem trophic structure of three U.S. Mid-Atlantic estuaries. Mar. Ecol. Prog. Ser.\u00a0161, 239\u2013254 (1997)","journal-title":"Mar. Ecol. Prog. Ser."},{"issue":"1","key":"30_CR6","first-page":"175","volume":"30","author":"A. Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of graphs: I. an index of the relative complexity of a graph. Bulletin of Mathematical Biology\u00a030(1), 175\u2013204 (1968)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"2","key":"30_CR7","first-page":"225","volume":"30","author":"A. Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of graphs: II. the information content of digraphs and infinite graphs. Bulletin of Mathematical Biology\u00a030(2), 225\u2013240 (1968)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"3","key":"30_CR8","first-page":"387","volume":"30","author":"A. Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of graphs: III. graphs with prescribed information content. Bulletin of Mathematical Biology\u00a030(3), 387\u2013414 (1968)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"4","key":"30_CR9","first-page":"533","volume":"30","author":"A. Mowshowitz","year":"1968","unstructured":"Mowshowitz, A.: Entropy and the complexity of graphs: IV. entropy measures and graphical structure. Bulletin of Mathematical Biology\u00a030(4), 533\u2013546 (1968)","journal-title":"Bulletin of Mathematical Biology"},{"doi-asserted-by":"crossref","unstructured":"Small, M.: Complex networks from time series: Capturing dynamics. In: IEEE International Symposium on Circuits and Systems Proceedings, pp. 2509\u20132512 (2013)","key":"30_CR10","DOI":"10.1109\/ISCAS.2013.6572389"},{"key":"30_CR11","first-page":"337","volume-title":"Proceedings of Artificial Life XII","author":"R.K. Standish","year":"2010","unstructured":"Standish, R.K.: Network complexity of foodwebs. In: Fellerman, H., et al. (eds.) Proceedings of Artificial Life XII, pp. 337\u2013343. MIT Press, Cambridge (2010)"},{"doi-asserted-by":"crossref","unstructured":"Standish, R.K.: Complexity of networks (reprise). Complexity 17, 50\u201361, arXiv: 0911.3482 (2012)","key":"30_CR12","DOI":"10.1002\/cplx.20393"}],"container-title":["Lecture Notes in Computer Science","Artificial Life and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14803-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:17:14Z","timestamp":1559085434000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14803-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319148021","9783319148038"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14803-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}