{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:54:59Z","timestamp":1725512099058},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_42","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"479-489","source":"Crossref","is-referenced-by-count":6,"title":["A Moderately Exponential Time Algorithm for Full Degree Spanning Tree"],"prefix":"10.1007","author":[{"given":"Serge","family":"Gaspers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey A.","family":"Stepanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"42_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/1097-0037(200012)36:4<203::AID-NET1>3.0.CO;2-U","volume":"36","author":"R. Bhatia","year":"2000","unstructured":"Bhatia, R., Khuller, S., Pless, R., Sussmann, Y.J.: The full degree spanning tree problem. Networks\u00a036(4), 203\u2013209 (2000)","journal-title":"Networks"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion\u2013Exclusion Algorithms for Counting Set Partitions. In: The proceedings of FOCS 2006, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: Fast Subset Convolution. In: The proceedings of STOC 2007, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/(SICI)1097-0037(200001)35:1<26::AID-NET3>3.0.CO;2-M","volume":"35","author":"H. Broersma","year":"2000","unstructured":"Broersma, H., Koppius, O.R., Tuinstra, H., Huck, A., Kloks, T., Kratsch, D., M\u00fcller, H.: Degree-preserving trees. Networks\u00a035(1), 26\u201339 (2000)","journal-title":"Networks"},{"issue":"1","key":"42_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N. Christofides","year":"1971","unstructured":"Christofides, N.: An Algorithm for the Chromatic Number of a Graph. Computer Journal\u00a014(1), 38\u201339 (1971)","journal-title":"Computer Journal"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11847250_17","volume-title":"Parameterized and Exact Computation","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a Minimum Feedback Vertex Set in Time O(1.7548 n ). In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 184\u2013191. Springer, Heidelberg (2006)"},{"key":"42_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/11523468_16","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2005","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: Domination - A Case Study. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 191\u2013203. Springer, Heidelberg (2005)"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Measure and Conquer: A simple O(20.288n ) Independent Set Algorithm. In: The proceedings of SODA 2006, pp. 18\u201325 (2006)","DOI":"10.1145\/1109557.1109560"},{"key":"42_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11944836_16","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: Solving Connected Dominating Set Faster Than 2 n . In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 152\u2013163. Springer, Heidelberg (2006)"},{"key":"42_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11847250_19","volume-title":"Parameterized and Exact Computation","author":"J. Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 203\u2013214. Springer, Heidelberg (2006)"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1137\/S0097539799363359","volume":"32","author":"S. Khuller","year":"2003","unstructured":"Khuller, S., Bhatia, R., Pless, R.: On Local Search and Placement of Meters in Networks. SIAM Journal of Computing\u00a032(2), 470\u2013487 (2003)","journal-title":"SIAM Journal of Computing"},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An O(2 n ) Algorithm for Graph Colouring and Other Partitioning Problems via Inclusion-Exclusion. In: The proceedings of FOCS 2006, pp. 583\u2013590 (2006)","DOI":"10.1109\/FOCS.2006.11"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the Shortest Spanning Subtree and the Traveling Salesman Problem. The proceedings of the American Mathematical Society\u00a07, 48\u201350 (1956)","journal-title":"The proceedings of the American Mathematical Society"},{"issue":"3","key":"42_CR14","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A Note on the Complexity of the Chromatic Number Problem. Information Processing Letters\u00a05(3), 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TCS.1987.1086107","volume":"34","author":"M. Lewinter","year":"1987","unstructured":"Lewinter, M.: Interpolation Theorem for the Number of Degree-Preserving Vertices of Spanning Trees. IEEE Transaction Circ. Syst.\u00a034, 205 (1987)","journal-title":"IEEE Transaction Circ. Syst."},{"issue":"2","key":"42_CR16","first-page":"243","volume":"115","author":"L.E. Ormsbee","year":"1989","unstructured":"Ormsbee, L.E.: Implicit Network Calibration, Journal of Water Resources. Planning and Management\u00a0115(2), 243\u2013257 (1989)","journal-title":"Planning and Management"},{"issue":"2","key":"42_CR17","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1061\/(ASCE)0733-9496(1986)112:2(166)","volume":"112","author":"L.E. Ormsbee","year":"1986","unstructured":"Ormsbee, L.E., Wood, D.J.: Explicit Pipe Network Calibratio. Journal of Water Resources, Planning and Management\u00a0112(2), 166\u2013182 (1986)","journal-title":"Journal of Water Resources, Planning and Management"},{"key":"42_CR18","unstructured":"Pothof, I.W.M., Schut, J.: Graph-theoretic approach to identifiability in a water distribution network. Memorandum, vol.\u00a01283, Universiteit Twent (1995)"},{"key":"42_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11785293_17","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"I. Razgon","year":"2006","unstructured":"Razgon, I.: Exact Computation of Maximum Induced Forest. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 160\u2013171. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:23Z","timestamp":1619522063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_42","relation":{},"subject":[]}}