{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:19Z","timestamp":1725544039879},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_17","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T16:03:36Z","timestamp":1265126616000},"page":"179-190","source":"Crossref","is-referenced-by-count":0,"title":["A Rooted-Forest Partition with Uniform Vertex Demand"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Katoh","sequence":"first","affiliation":[]},{"given":"Shin-ichi","family":"Tanigawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Crapo, H.: On the generic rigidity of plane frameworks. Technical report, Institut National de Recherche en Informatique et en Automatique (1990)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Fekete, Z., Szeg\u00f6, L.: A note on [k,l]-sparse graphs. In: Graph Theory in Paris; A Conference in Memory of Claude Berge, pp. 169\u2013177 (2004)","DOI":"10.1007\/978-3-7643-7400-6_13"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0166-218X(02)00464-X","volume":"131","author":"A. Frank","year":"2003","unstructured":"Frank, A., Szego, L.: Constructive characterizations for packing and covering with trees. Discrete Applied Mathematics\u00a0131(2), 347\u2013371 (2003)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(88)90089-0","volume":"27","author":"H. Gabow","year":"1988","unstructured":"Gabow, H., Tarjan, R.: A linear-time algorithm for finding a minimum spanning pseudoforest. Information Processing Letters\u00a027(5), 259\u2013263 (1988)","journal-title":"Information Processing Letters"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H. Gabow","year":"1992","unstructured":"Gabow, H., Westermann, H.: Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica\u00a07(1), 465\u2013497 (1992)","journal-title":"Algorithmica"},{"key":"17_CR6","first-page":"129","volume":"63","author":"R. Haas","year":"2002","unstructured":"Haas, R.: Characterizations of arboricity of graphs. Ars Combinatoria\u00a063, 129\u2013138 (2002)","journal-title":"Ars Combinatoria"},{"issue":"3","key":"17_CR7","doi-asserted-by":"crossref","first-page":"186","DOI":"10.15807\/jorsj.26.186","volume":"26","author":"H. Imai","year":"1983","unstructured":"Imai, H.: Network flow algorithms for lower truncated transversal polymatroids. Journal of the Operations Research Society of Japan\u00a026(3), 186\u2013210 (1983)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/1542362.1542415","volume-title":"Proceedings of the 25th annual symposium on Computational geometry","author":"N. Katoh","year":"2009","unstructured":"Katoh, N., Tanigawa, S.: A proof of the molecular conjecture. In: Proceedings of the 25th annual symposium on Computational geometry, pp. 296\u2013305. ACM, New York (2009)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/978-3-642-10631-6_54","volume-title":"ISAAC 2009","author":"N. Katoh","year":"2009","unstructured":"Katoh, N., Tanigawa, S.: On the infinitesimal rigidity of bar-and-slider frameworks. In: Dong, Y., Du, D.-Z. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 524\u2013533. Springer, Heidelberg (2009)"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"Laman, G.: On graphs and rigidity of plane skeletal structures. Journal of Engineering mathematics\u00a04(4), 331\u2013340 (1970)","journal-title":"Journal of Engineering mathematics"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"1","author":"C. Nash-Williams","year":"1961","unstructured":"Nash-Williams, C.: Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society\u00a01(1), 445 (1961)","journal-title":"Journal of the London Mathematical Society"},{"key":"17_CR12","volume-title":"Matroid theory","author":"J. Oxley","year":"1992","unstructured":"Oxley, J.: Matroid theory. Oxford University Press, USA (1992)"},{"issue":"1-31","key":"17_CR13","first-page":"33","volume":"30","author":"J. Pym","year":"1970","unstructured":"Pym, J., Perfect, H.: Submodular functions and independence structures. J. Math. Anal. Appl.\u00a030(1-31), 33 (1970)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0166-218X(84)90079-9","volume":"8","author":"A. Recski","year":"1984","unstructured":"Recski, A.: Network theory approach to the rigidity of skeletal structures. Part II. Laman\u2019s theorem and topological formulae. Discrete Appl. Math.\u00a08(1), 63\u201368 (1984)","journal-title":"Discrete Appl. Math."},{"key":"17_CR15","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial optimization: polyhedra and efficiency. Springer, Heidelberg (2003)"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0095-8956(84)90016-9","volume":"36","author":"T. Tay","year":"1984","unstructured":"Tay, T.: Rigidity of multi-graphs. I. Linking rigid bodies in n-space. Journal of combinatorial theory. Series B\u00a036(1), 95\u2013112 (1984)","journal-title":"Journal of combinatorial theory. Series B"},{"issue":"1","key":"17_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF01788678","volume":"5","author":"T. Tay","year":"1989","unstructured":"Tay, T.: Linking (n\u2009\u2212\u20092)-dimensional panels in n-space II:(n\u2009\u2212\u20092, 2)-frameworks and body and hinge structures. Graphs and Combinatorics\u00a05(1), 245\u2013273 (1989)","journal-title":"Graphs and Combinatorics"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02988323","volume":"9","author":"T. Tay","year":"1993","unstructured":"Tay, T.: A new proof of Lamans theorem. Graphs and combinatorics\u00a09(2), 365\u2013370 (1993)","journal-title":"Graphs and combinatorics"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"W. Tutte","year":"1961","unstructured":"Tutte, W.: On the problem of decomposing a graph into n connected factors. J. London Math. Soc.\u00a036, 221\u2013230 (1961)","journal-title":"J. London Math. Soc."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/0401025","volume":"1","author":"W. Whiteley","year":"1988","unstructured":"Whiteley, W.: The union of matroids and the rigidity of frameworks. SIAM Journal on Discrete Mathematics\u00a01, 237 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/conm\/197\/02540","volume":"197","author":"W. Whiteley","year":"1996","unstructured":"Whiteley, W.: Some matroids from discrete applied geometry. Contemporary Mathematics\u00a0197, 171\u2013312 (1996)","journal-title":"Contemporary Mathematics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:32Z","timestamp":1606185632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}