{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:49:00Z","timestamp":1725468540860},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055822","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"713-721","source":"Crossref","is-referenced-by-count":0,"title":["Degree-preserving forests"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Huck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ton","family":"Kloks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otto","family":"Koppius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiko","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilde","family":"Tuinstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"69_CR1","first-page":"31","volume":"XXVII","author":"M. Aaron","year":"1994","unstructured":"Aaron, M. and M. Lewinter, 0-deficient vertices of spanning trees, NY Acad. Sci. Graph Theory Notes\n                XXVII, (1994), pp. 31\u201332.","journal-title":"NY Acad. Sci. Graph Theory Notes"},{"key":"69_CR2","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg S., J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, Journal of Algorithms\n                12, (1991), pp. 308\u2013340.","journal-title":"Journal of Algorithms"},{"key":"69_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. S. Baker","year":"1994","unstructured":"Baker, B. S., Approximation algorithms for NP-complete problems on planar graphs, J. ACM\n                41, (1994), pp. 153\u2013180.","journal-title":"J. ACM"},{"key":"69_CR4","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., O. Goldreich and M. Sudan, Free bits, PCPs and non-approximability \u2014 towards tight results, SIAM J. Comput.\n                27 (1998), pp. 804\u2013915.","journal-title":"SIAM J. Comput."},{"key":"69_CR5","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"P. M. Camerini","year":"1980","unstructured":"Camerini, P. M., G. Galbiati and F. Maffioli, Complexity of spanning tree problems: Part I, Eur. J. Oper. Res.\n                5, (1980), pp. 346\u2013352.","journal-title":"Eur. J. Oper. Res."},{"key":"69_CR6","first-page":"53","volume":"44","author":"P. M. Camerini","year":"1984","unstructured":"Camerini, P. M., G. Galbiati and F. Maffioli, The complexity of weighted multiconstrained spanning tree problems, Colloq. Math. Soc. Janos Bolyai\n                44, (1984), pp. 53\u2013101.","journal-title":"Colloq. Math. Soc. Janos Bolyai"},{"key":"69_CR7","unstructured":"Damaschke, P., Degree-preserving spanning trees and coloring bounded degree graphs, Manuscript 1997."},{"key":"69_CR8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F","volume":"27","author":"M. Dell'Amico","year":"1996","unstructured":"Dell'Amico, M., M. Labb\u00e9 and F. Maffioli, Complexity of spanning tree problems with leaf-dependent objectives, Networks\n                27, (1996), pp. 175\u2013181.","journal-title":"Networks"},{"key":"69_CR9","volume-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and D.S. Johnson, Computers and Intractability: A guide to the Theory of NP-completeness, Freeman, New York, 1979."},{"key":"69_CR10","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"key":"69_CR11","unstructured":"H\u00e5stad, J., Clique is hard to approximate within n\n                1-\u025b, Proc. 37th Ann. IEEE Symp. on Foundations of Comput. Sci., (1996), IEEE Computer Society, pp. 627\u2013636."},{"key":"69_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TCS.1987.1086107","volume":"CAS-34","author":"M. Lewinter","year":"1987","unstructured":"Lewinter, M., Interpolation theorem for the number of degree-preserving vertices of spanning trees, IEEE Trans. Circ. Syst.\n                CAS-34, (1987), 205.","journal-title":"IEEE Trans. Circ. Syst."},{"key":"69_CR13","first-page":"26","volume":"XIII","author":"M. Lewinter","year":"1987","unstructured":"Lewinter, M. and M. Migdail-Smith, Degree-preserving vertices of spanning trees of the hypercube, NY Acad. Sci. Graph Theory Notes\n                XIII, (1987), 26\u201327.","journal-title":"NY Acad. Sci. Graph Theory Notes"},{"key":"69_CR14","volume-title":"Memorandum 1283","author":"I. W. M. Pothof","year":"1995","unstructured":"Pothof, I. W. M. and J. Schut, Graph-theoretic approach to identifiability in a water distribution network, Memorandum 1283, Faculty of Applied Mathematics, University of Twente, Enschede, the Netherlands, (1995)."},{"key":"69_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0965-9978(95)00020-W","volume":"22","author":"Rahal","year":"1995","unstructured":"Rahal, A co-tree flows formulation for steady state in water distribution networks, Adv. Eng. Softw.\n                22, (1995), pp. 169\u2013178.","journal-title":"Adv. Eng. Softw."},{"key":"69_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61823-9","volume-title":"Identifiability of state space models with applications to transformation systems","author":"E. Walter","year":"1982","unstructured":"Walter, E., Identifiability of state space models with applications to transformation systems, Springer-Verlag, New York NY, USA, 1982."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T23:21:58Z","timestamp":1549927318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055822"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0055822","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}