{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:23:57Z","timestamp":1761895437271},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,10]],"date-time":"2012-02-10T00:00:00Z","timestamp":1328832000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s10852-012-9182-8","type":"journal-article","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T12:29:59Z","timestamp":1328790599000},"page":"249-268","source":"Crossref","is-referenced-by-count":13,"title":["The Maximum Degree & Diameter-Bounded Subgraph and its Applications"],"prefix":"10.1007","volume":"11","author":[{"given":"Anthony","family":"Dekker","sequence":"first","affiliation":[]},{"given":"Hebert","family":"P\u00e9rez-Ros\u00e9s","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"Pineda-Villavicencio","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Watters","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,10]]},"reference":[{"key":"9182_CR1","unstructured":"Amini, O., Peleg, D., Perennes, S., Sau, I., Saurabh, S.: Degree-constrained subgraph problems: hardness and approximation results. In: Procs. ALGO-WAOA, 2008. LNCS, vol. 5426, pp. 29\u201342 (2008)"},{"key":"9182_CR2","unstructured":"Asahiro, Y., Miyano, E., Samizo, K.: Approximating maximum diameter-bounded subgraphs. In: Procs. LATIN, 2010. LNCS, vol. 6034, pp. 615\u2013626 (2010)"},{"key":"9182_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"9182_CR4","unstructured":"Barab\u00e1si, A.-L.: Linked: The New Science of Networks. Perseus Publishing (2002)"},{"key":"9182_CR5","volume-title":"Covering Codes","author":"G Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)"},{"key":"9182_CR6","unstructured":"Dekker, A., Colbert, B.: Network robustness and graph topology. In: Procs. 27th Australasian Comp. Science Conf., CRPIT, vol. 26, pp. 359\u2013368 (2004)"},{"key":"9182_CR7","unstructured":"Dekker, A.: Simulating network robustness for critical infrastructure networks. In: Procs. 28th Australasian Comp. Science Conf., CRPIT, vol. 38, pp. 59\u201367 (2005)"},{"key":"9182_CR8","unstructured":"Dekker, A., Colbert, B.: The symmetry ratio of a network. In: Procs. 11th Computing: The Australasian Theory Symposium, CRPIT, vol. 41, pp. 13\u201320 (2005)"},{"key":"9182_CR9","doi-asserted-by":"crossref","first-page":"27104","DOI":"10.1103\/PhysRevE.72.027104","volume":"72","author":"J Duch","year":"2005","unstructured":"Duch, J., Arenas, A.: Community identification using extremal optimization. Phys. Rev. E. 72, 027104 (2005)","journal-title":"Phys. Rev. E."},{"key":"9182_CR10","doi-asserted-by":"crossref","unstructured":"Elspas, B.: Topological constraints on interconnection-limited logic. In: Proceedings of the Fifth IEEE Annual Symposium on Switching Circuit Theory and Logical Design, pp. 133\u2013137 (1964)","DOI":"10.1109\/SWCT.1964.27"},{"key":"9182_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1002\/jgt.1007","volume":"37","author":"G Exoo","year":"2001","unstructured":"Exoo, G.: A family of graphs and the degree-diameter problem. J. Graph Theory 37, 118\u2013124 (2001)","journal-title":"J. Graph Theory"},{"key":"9182_CR12","unstructured":"Garey, M., Johnson, D.: Computers and Intractability. A Guide to the Theory of NP-completeness. Freeman and Co. (1979)"},{"key":"9182_CR13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0196-6774(85)90025-2","volume":"6","author":"D Johnson","year":"1985","unstructured":"Johnson, D.: The NP-completeness column: an ongoing guide. J. Algorithms 6, 145\u2013159 (1985)","journal-title":"J. Algorithms"},{"key":"9182_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds). Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9182_CR15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s00453-004-1121-2","volume":"41","author":"J K\u00f6nemann","year":"2005","unstructured":"K\u00f6nemann, J., Levin, A., Sinha, A.: Approximating the degree-bounded minimum diameter spanning tree problem. Algorithmica 41, 117\u2013129 (2005)","journal-title":"Algorithmica"},{"key":"9182_CR16","unstructured":"Kumar, N.: Bounding the volume of Hamming balls. http:\/\/cstheory.wordpress.com\/2010\/08\/13\/bounding-the-volume-of-hamming-balls . Accessed Feb 2011"},{"key":"9182_CR17","unstructured":"Loz, E., P\u00e9rez-Ros\u00e9s, H., Pineda-Villavicencio, G.: Combinatorics wiki \u2013 the degree diameter problem for general graphs. http:\/\/combinatoricswiki.org\/wiki\/The_Degree_Diameter_Problem_for_General_Graphs . Accessed 14 Jan 2012"},{"key":"9182_CR18","unstructured":"Loz, E., P\u00e9rez-Ros\u00e9s, H., Pineda-Villavicencio, G.: Combinatorics wiki - MaxDDBS in the mesh. http:\/\/combinatoricswiki.org\/wiki\/MaxDDBS_in_the_mesh . Accessed on 14 Jan 2012"},{"key":"9182_CR19","first-page":"1","volume":"14","author":"M Miller","year":"2005","unstructured":"Miller, M., Siran, J.: Moore graphs and beyond: a survey of the degree-diameter problem. Electron. J. Combin., Dynamic Survey 14, 1\u201361 (2005)","journal-title":"Electron. J. Combin., Dynamic Survey"},{"key":"9182_CR20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"1","author":"R Ravi","year":"2001","unstructured":"Ravi, R., Marathe, M., Ravi, S., Rosenkrantz, D., Hunt\u00a0III, H.B.: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 1, 58\u201378 (2001)","journal-title":"Algorithmica"},{"key":"9182_CR21","doi-asserted-by":"crossref","first-page":"245","DOI":"10.4064\/aa120-3-3","volume":"120","author":"M Skriganov","year":"2005","unstructured":"Skriganov, M., Sobolev, A.: Variation of the number of lattice points in large balls. Acta Arith. 120, 245\u2013267 (2005)","journal-title":"Acta Arith."},{"key":"9182_CR22","doi-asserted-by":"crossref","unstructured":"Sohaee, N., Forst, C.: Bounded diameter clustering scheme for protein interaction networks. In: Procs. World Congress on Engineering and Computer Science, vol. I (2009)","DOI":"10.1109\/CIBCB.2010.5510590"},{"key":"9182_CR23","unstructured":"Watts, D.: Six Degrees: The Science of a Connected Age. William Heinemann (2003)"},{"key":"9182_CR24","unstructured":"Widmer, M.: Lipschitz Class, Narrow Class, and Counting Lattice Points. Report 2010\u201313, Graz University of Technology (2010)"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9182-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-012-9182-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-012-9182-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T10:48:26Z","timestamp":1561286906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-012-9182-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9182"],"URL":"https:\/\/doi.org\/10.1007\/s10852-012-9182-8","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,10]]}}}