乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T05:56:38Z","timestamp":1720590998654},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0166-218x(00)00227-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:17:26Z","timestamp":1027621046000},"page":"3-21","source":"Crossref","is-referenced-by-count":11,"title":["Graphs with bounded induced distance"],"prefix":"10.1016","volume":"108","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[]},{"given":"Gabriele Di","family":"Stefano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00227-4_BIB1","doi-asserted-by":"crossref","unstructured":"H.J. Bandelt, A. D'Atri, M. Moscarini, H.M. Mulder, A. Schultze, Operations on distance hereditary graphs, Technical Report 226, CNR, Istituto di Analisi dei Sistemi e Informatica del CNR, Rome, Italy, 1988.","DOI":"10.1137\/0217032"},{"issue":"2","key":"10.1016\/S0166-218X(00)00227-4_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","article-title":"Distance-hereditary graphs","volume":"41","author":"Bandelt","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB3","first-page":"196","article-title":"Transforming trees by successive local complementations","volume":"4","author":"Bouchet","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB4","unstructured":"A. Brandst\u00e4dt, Special graph classes, Technical Report SM-DU-199, University of Duisburg, 1993."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C","article-title":"A linear time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs","volume":"31","author":"Brandst\u00e4dt","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(99)00075-X","article-title":"Graph classes between parity and distance-hereditary graphs","volume":"95","author":"Cicerone","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB7","unstructured":"S. Cicerone, G. Di Stefano, Port and node support to compact routing, Technical Report R.97-17, Dipartimento di Ingegneria Elettrica, Universit\u00e0 di L'Aquila, L'Aquila, Italy, 1997."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB8","doi-asserted-by":"crossref","unstructured":"S. Cicerone, G. Di Stefano, in: Graphs with bounded induced distance, in: 24th International Workshop on Graph Theoretic Concepts in Computer Science (WG\u201998), Lecture Notes in Computer Science, Vol. 1517, eds. J. Hromkovic, O. S\u00fdkora, Springer, Berlin, 1998, pp. 177\u2013191.","DOI":"10.1007\/10692760_15"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB9","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1137\/0603021","article-title":"Decomposition of directed graphs","volume":"3","author":"Cunningham","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB10","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1137\/0217032","article-title":"Distance-hereditary graphs, Steiner trees, and connected domination","volume":"17","author":"D'Atri","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB11","unstructured":"G. Di Stefano, A routing algorithm for networks based on distance-hereditary topologies, in: Third International Colloquium on Structural Information and Communication Complexity (SIROCCO\u201996), 1996."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB12","doi-asserted-by":"crossref","unstructured":"F.F. Dragan, Dominating cliques in distance-hereditary graphs, in: 4th Scandinavian Workshop on Algorithm Theory (SWAT\u201994), Lecture Notes in Computer Science, Vol. 824, eds. E.M. Smit, S. Skyum, Springer, Berlin, 1994, pp. 370\u2013381.","DOI":"10.1007\/3-540-58218-5_34"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB13","first-page":"213","article-title":"Distance-hereditary graphs and multidestination message-routing in multicomputers","volume":"13","author":"Esfahanian","year":"1993","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","article-title":"Designing networks with compact routing tables","volume":"3","author":"Frederickson","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB15","series-title":"Computers and Intractability. A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","article-title":"Completely separable graphs","volume":"27","author":"Hammer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB17","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"28","key":"10.1016\/S0166-218X(00)00227-4_BIB18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"Distance hereditary graphs","volume":"2","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB19","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The new routing algorithm for the ARPANET","volume":"COM-28","author":"McQuillan","year":"1980","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB20","doi-asserted-by":"crossref","first-page":"1280","DOI":"10.1109\/TCOM.1979.1094552","article-title":"A failsafe distributed routing protocol","volume":"COM-27","author":"Merlin","year":"1979","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB21","unstructured":"F. Nicolai, Hamiltonian problems on distance-hereditary graphs, Technical Report SM-DU-264, University of Duisburg, 1994."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","article-title":"Graph spanners","volume":"13","author":"Peleg","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00227-4_BIB23","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TCOM.1980.1094690","article-title":"Routing techniques used in computer communication networks","volume":"COM-28","author":"Schwartz","year":"1980","journal-title":"IEEE Trans. Comm."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB24","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1093\/comjnl\/30.4.298","article-title":"Interval routing","volume":"30","author":"van Leeuwen","year":"1987","journal-title":"Comput. J."},{"key":"10.1016\/S0166-218X(00)00227-4_BIB25","doi-asserted-by":"crossref","unstructured":"H.G. Yeh, G.J. Chang, Weighted connected domination and Steiner trees in distance-hereditary graphs, in: 4th Franco\u2013Japanese and Franco\u2013Chinese Conference on Combinatorics and Computer Science, Lecture Notes in Computer Science, Vol. 1120, eds. I. Manoussakis, R. Euler, M. Deza, Springer, Berlin, 1996, pp. 48\u201352.","DOI":"10.1007\/3-540-61576-8_72"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:22:24Z","timestamp":1556065344000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0166218X00002274"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00227-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}