{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:29Z","timestamp":1725552149169},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_23","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"261-270","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Hypergraph Tree-Realization"],"prefix":"10.1007","author":[{"given":"Ephraim","family":"Korach","sequence":"first","affiliation":[]},{"given":"Margarita","family":"Razgon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM\u00a030, 479\u2013513 (1983)","journal-title":"Journal of the ACM"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02591988","volume":"36","author":"C. Brezovec","year":"1986","unstructured":"Brezovec, C., Cornuejols, G., Glover, F.: Two algorithms for weighted matroid intersection. Mathematical Programming, Series A\u00a036, 39\u201353 (1986)","journal-title":"Mathematical Programming, Series A"},{"key":"23_CR3","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"issue":"1-3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10107-003-0410-x","volume":"98","author":"E. Korach","year":"2003","unstructured":"Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Mathematical Programming, Series B\u00a098(1-3), 385\u2013414 (2003)","journal-title":"Mathematical Programming, Series B"},{"doi-asserted-by":"crossref","unstructured":"McKee, T., McMorris, F.: Topics in Interesection Graph Theory. Siam Monographs on Discrete Mathematics and Applications (1999)","key":"23_CR5","DOI":"10.1137\/1.9780898719802"},{"key":"23_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22143-3","volume-title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","author":"A. Recski","year":"1989","unstructured":"Recski, A.: Matroid Theory and its Applications in Electric Network Theory and in Statics. Springer, Heidelberg (1989)"},{"key":"23_CR7","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539792235487","volume":"23","author":"R. Swaminathan","year":"1994","unstructured":"Swaminathan, R., Wagner, D.: On the consecutive-retrieval problem. SIAM Journal of Computing\u00a023(2), 398\u2013414 (1994)","journal-title":"SIAM Journal of Computing"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing\u00a013, 566\u2013579 (1984)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11604686_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:22Z","timestamp":1619507062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11604686_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}