{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T03:22:29Z","timestamp":1722914549881},"reference-count":30,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1002\/(sici)1097-0037(200001)35:1<26::aid-net3>3.0.co;2-m","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T05:25:31Z","timestamp":1100409931000},"page":"26-39","source":"Crossref","is-referenced-by-count":14,"title":["Degree-preserving trees"],"prefix":"10.1002","volume":"35","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otto","family":"Koppius","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hilde","family":"Tuinstra","sequence":"additional","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":"Dieter","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiko","family":"M\ufffdller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB1","first-page":"31","volume":"27","author":"Aaron","year":"1994","journal-title":"NY Acad Sci Graph Theory Notes"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"Arnborg","year":"1991","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"Baker","year":"1994","journal-title":"J ACM"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB4","author":"Bhatia","unstructured":"and The full degree spanning tree problem, Proc 10th Annual ACM?SIAM Symp on Discrete Algorithms, SODA '99, to appear."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"Bienstock","year":"1990","journal-title":"Algorithmica"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB6","first-page":"42","volume":"29","author":"Bocchi","year":"1995","journal-title":"NY Acad Sci Graph Theory Notes"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB7","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J Comput"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"Booth","year":"1976","journal-title":"J Comput Syst Sci"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB9","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"Borie","year":"1992","journal-title":"Algorithmica"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB10","series-title":"Lecture Notes","first-page":"760","volume-title":"Independent sets in asteroidal triple-free graphs","volume":"1256","author":"Broersma","year":"1997","unstructured":"and Independent sets in asteroidal triple-free graphs, Proc 24th Int Colloq on Automata, Languages and Programming, ICALP'97, Lecture Notes in Computer Science 1256, Springer-Verlag, Berlin, 1997, 760-770."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0377-2217(80)90164-2","volume":"5","author":"Camerini","year":"1980","journal-title":"Eur J Oper Res"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB12","first-page":"53","volume":"44","author":"Camerini","year":"1984","journal-title":"Colloq Math Soc Janos Bolyai"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J Symb Comput"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"Corneil","year":"1997","journal-title":"SIAM J Discr Math"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB15","author":"Damaschke","year":"1997","unstructured":"Degree-preserving spanning trees and coloring bounded degree graphs, manuscript, 1997."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<175::AID-NET2>3.0.CO;2-F","volume":"27","author":"Dell'Amico","year":"1996","journal-title":"Networks"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB17","author":"de Fluiter","year":"1997","unstructured":"Algorithms for graphs of small treewidth, PhD Thesis, Utrecht University, Utrecht, The Netherlands, 1997."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB18","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, 1979."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB19","volume-title":"Algorithmic graph theory and perfect graphs","author":"Golumbic","year":"1980","unstructured":"Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB20","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB21","series-title":"LNCS","volume-title":"Treewidth-computations and approximations","volume":"842","author":"Kloks","year":"1994","unstructured":"Treewidth-computations and approximations, LNCS 842, Springer-Verlag, Berlin, 1994."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB22","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/0406032","volume":"6","author":"Kratsch","year":"1993","journal-title":"SIAM J Discr Math"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB23","first-page":"527","volume-title":"Graph algorithms, Handbook of theoretical computer science, A: Algorithms and complexity","author":"van Leeuwen","year":"1990","unstructured":"Graph algorithms, Handbook of theoretical computer science, A: Algorithms and complexity, (Editor), Elsevier, Amsterdam, 1990, 527-631."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB24","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fundam Math"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/TCS.1987.1086107","volume":"CAS-34","author":"Lewinter","year":"1987","journal-title":"IEEE Trans Circ Syst"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB26","first-page":"26","volume":"13","author":"Lewinter","year":"1987","journal-title":"NY Acad Sci Graph Theory Notes"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB27","author":"McConnell","unstructured":"and Linear time transitive orientation, Proc 8th Ann ACM?SIAM Symp on Discrete Algorithms, SODA'97, 19-25."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB28","author":"Pothof","year":"1995","unstructured":"and Graph-theoretic approach to identifiability in a water distribution network, Memorandum 1283, Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, 1995."},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0965-9978(95)00020-W","volume":"22","author":"Rahal","year":"1995","journal-title":"Adv Eng Softw"},{"key":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M-BIB30","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":"Walter","year":"1982","unstructured":"Identifiability of state space models with applications to transformation systems, Springer-Verlag, New York, 1982."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(200001)35:1%3C26::AID-NET3%3E3.0.CO;2-M","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(200001)35:1%3C26::AID-NET3%3E3.0.CO;2-M","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:17:57Z","timestamp":1625134677000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(200001)35:1<26::aid-net3>3.0.co;2-m","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}