{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:08:36Z","timestamp":1648876116528},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T00:00:00Z","timestamp":1291161600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10878-010-9367-x","type":"journal-article","created":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T17:02:36Z","timestamp":1291136556000},"page":"67-98","source":"Crossref","is-referenced-by-count":4,"title":["A rooted-forest partition with uniform vertex demand"],"prefix":"10.1007","volume":"24","author":[{"given":"Naoki","family":"Katoh","sequence":"first","affiliation":[]},{"given":"Shin-ichi","family":"Tanigawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,12,1]]},"reference":[{"key":"9367_CR1","unstructured":"B\u00e9rczi K, Frank A (2009) Packing arborescences. Technical Report 2009-04, EGRES"},{"key":"9367_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-540-39658-1_10","volume-title":"Proceedings of the 11th annual European symposium on algorithms (ESA)","author":"A Berg","year":"2003","unstructured":"Berg A, Jord\u00e1n T (2003) Algorithms for graph rigidity and scene analysis. In: Proceedings of the 11th annual European symposium on algorithms (ESA). Lecture notes in computer science, vol 2832. Springer, Berlin, pp 78\u201389"},{"key":"9367_CR3","unstructured":"Crapo H (1990) On the generic rigidity of plane frameworks. Technical report, Institut National de Recherche en Informatique et en Automatique"},{"key":"9367_CR4","first-page":"69","volume-title":"Combinatorial structures and their applications","author":"J Edmonds","year":"1970","unstructured":"Edmonds J (1970) Submodular functions, matroids, and certain polyhedra. In: Guy R, Hanani H, Sauer N, Sch\u00f6nheim J (eds) Combinatorial structures and their applications. Gordon and Breach, New York, pp 69\u201387"},{"key":"9367_CR5","first-page":"91","volume-title":"Combinatorial algorithms","author":"J Edmonds","year":"1973","unstructured":"Edmonds J (1973) Edge disjoint branchings. In: Rustin B (ed) Combinatorial algorithms. Algorithmics Press, New York, pp 91\u201396"},{"key":"9367_CR6","first-page":"169","volume-title":"Graph theory in Paris; a conference in memory of Claude Berge","author":"Z Fekete","year":"2004","unstructured":"Fekete Z, Szeg\u00f6 L (2004) A note on [k,l]-sparse graphs. In: Graph theory in Paris; a conference in memory of Claude Berge, pp 169\u2013177"},{"issue":"2","key":"9367_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0166-218X(02)00464-X","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank A, Szeg\u00f6 L (2003) Constructive characterizations for packing and covering with trees. Discrete Appl Math 131(2):347\u2013371","journal-title":"Discrete Appl Math"},{"key":"9367_CR8","author":"S Fujishige","year":"2010","unstructured":"Fujishige S (2010) A note on disjoint arborescences. Combinatorica. doi: 10.1007\/s00493-010-2518-y","journal-title":"Combinatorica"},{"issue":"5","key":"9367_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(88)90089-0","volume":"27","author":"H Gabow","year":"1988","unstructured":"Gabow H, Tarjan R (1988) A linear-time algorithm for finding a minimum spanning pseudoforest. Inform Process Lett 27(5):259\u2013263","journal-title":"Inform Process Lett"},{"issue":"1","key":"9367_CR10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"H Gabow","year":"1992","unstructured":"Gabow H, Westermann H (1992) Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(1):465\u2013497","journal-title":"Algorithmica"},{"key":"9367_CR11","first-page":"129","volume":"63","author":"R Haas","year":"2002","unstructured":"Haas R (2002) Characterizations of arboricity of graphs. Ars Combin 63:129\u2013138","journal-title":"Ars Combin"},{"issue":"4","key":"9367_CR12","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0016-0032(65)90340-6","volume":"279","author":"S Hakimi","year":"1965","unstructured":"Hakimi S (1965) On the degrees of the vertices of a directed graph. J Franklin Inst 279(4):290\u2013308","journal-title":"J Franklin Inst"},{"key":"9367_CR13","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1145\/1529282.1529530","volume-title":"Proceedings of the 25th ACM symposium on applied computing","author":"K Haller","year":"2009","unstructured":"Haller K, Lee A, Sitharam M, Streinu I, White N (2009) Body-and-cad geometric constraint systems. In: Proceedings of the 25th ACM symposium on applied computing. ACM, New York, pp 1127\u20131131"},{"issue":"3","key":"9367_CR14","first-page":"186","volume":"26","author":"H Imai","year":"1983","unstructured":"Imai H (1983) Network flow algorithms for lower truncated transversal polymatroids. J Oper Res Soc Japan 26(3):186\u2013210","journal-title":"J Oper Res Soc Japan"},{"key":"9367_CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.4018\/978-1-60566-396-8.ch006","volume-title":"Localization algorithms and strategies for wireless sensor networks","author":"B Jackson","year":"2009","unstructured":"Jackson B, Jord\u00e1n T (2009) Graph theoretic techniques in the analysis of uniquely localizable sensor networks. In: Mao G, Fidan B (eds) Localization algorithms and strategies for wireless sensor networks. IGI Global, Hershey, pp 146\u2013173"},{"issue":"2","key":"9367_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00493-009-2428-z","volume":"29","author":"N Kamiyama","year":"2009","unstructured":"Kamiyama N, Katoh N, Takizawa A (2009) Arc-disjoint in-trees in directed graphs. Combinatorica 29(2):197\u2013214","journal-title":"Combinatorica"},{"key":"9367_CR17","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":"Proceedings of the 20th international symposium on algorithms and computation (ISAAC 2009)","author":"N Katoh","year":"2009","unstructured":"Katoh N, Tanigawa S (2009) On the infinitesimal rigidity of bar-and-slider frameworks. In: Proceedings of the 20th international symposium on algorithms and computation (ISAAC 2009). Lecture notes in computer science, vol 5878. Springer, Berlin, pp 524\u2013533"},{"issue":"4","key":"9367_CR18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G Laman","year":"1970","unstructured":"Laman G (1970) On graphs and rigidity of plane skeletal structures. J Eng Math 4(4):331\u2013340","journal-title":"J Eng Math"},{"issue":"8","key":"9367_CR19","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1016\/j.disc.2007.07.104","volume":"308","author":"A Lee","year":"2008","unstructured":"Lee A, Streinu I (2008) Pebble game algorithms and sparse graphs. Discrete Math 308(8):1425\u20131437","journal-title":"Discrete Math"},{"issue":"1","key":"9367_CR20","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","volume":"1","author":"C Nash-Williams","year":"1961","unstructured":"Nash-Williams C (1961) Edge-disjoint spanning trees of finite graphs. J Lond Math Soc 1(1):445\u2013450","journal-title":"J Lond Math Soc"},{"key":"9367_CR21","volume-title":"Matroid Theory","author":"J Oxley","year":"1992","unstructured":"Oxley J (1992) Matroid Theory. Oxford University Press, London"},{"issue":"1\u201331","key":"9367_CR22","first-page":"33","volume":"30","author":"J Pym","year":"1970","unstructured":"Pym J, Perfect H (1970) Submodular functions and independence structures. J Math Anal Appl 30(1\u201331):33","journal-title":"J Math Anal Appl"},{"issue":"1","key":"9367_CR23","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(84)90079-9","volume":"8","author":"A Recski","year":"1988","unstructured":"Recski A (1988) Network theory approach to the rigidity of skeletal structures. Part\u00a0ii. Laman\u2019s theorem and topological formulae. Discrete Appl Math 8(1):63\u201368","journal-title":"Discrete Appl Math"},{"key":"9367_CR24","volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Springer, Berlin"},{"issue":"2","key":"9367_CR25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s00373-008-0834-4","volume":"25","author":"I Streinu","year":"2009","unstructured":"Streinu I, Theran L (2009) Sparsity-certifying graph decompositions. Graphs Combin 25(2):219\u2013238","journal-title":"Graphs Combin"},{"issue":"3","key":"9367_CR26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0166-218X(85)90051-4","volume":"10","author":"K Sugihara","year":"1985","unstructured":"Sugihara K (1985) Detection of structural inconsistency in systems of equations with degrees of freedom and its applications. Discrete Appl Math 10(3):297\u2013312","journal-title":"Discrete Appl Math"},{"issue":"1","key":"9367_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(84)90016-9","volume":"36","author":"T Tay","year":"1984","unstructured":"Tay T (1984) Rigidity of multi-graphs. I: Linking rigid bodies in n-space. J Combin Theory Ser B 36(1):95\u2013112","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"9367_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01788678","volume":"5","author":"T Tay","year":"1989","unstructured":"Tay T (1989) Linking (n\u22122)-dimensional panels in n-space II: (n\u22122,2)-frameworks and body and hinge structures. Graphs Combin 5(1):245\u2013273","journal-title":"Graphs Combin"},{"issue":"2","key":"9367_CR29","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02988323","volume":"9","author":"T Tay","year":"1993","unstructured":"Tay T (1993) A new proof of Laman\u2019s theorem. Graphs Combin 9(2):365\u2013370","journal-title":"Graphs Combin"},{"key":"9367_CR30","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","volume":"36","author":"WT Tutte","year":"1961","unstructured":"Tutte WT (1961) On the problem of decomposing a graph into n connected factors. J Lond Math Soc 36:221\u2013230","journal-title":"J Lond Math Soc"},{"issue":"2","key":"9367_CR31","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/0401025","volume":"1","author":"W Whiteley","year":"1988","unstructured":"Whiteley W (1988) The union of matroids and the rigidity of frameworks. SIAM J Discrete Math 1(2):237\u2013255","journal-title":"SIAM J Discrete Math"},{"key":"9367_CR32","doi-asserted-by":"crossref","first-page":"S116","DOI":"10.1088\/1478-3975\/2\/4\/S06","volume":"2","author":"W Whiteley","year":"2005","unstructured":"Whiteley W (2005) Counting out to the flexibility of molecules. Phys Biol 2:S116\u2013S126","journal-title":"Phys Biol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9367-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-010-9367-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-010-9367-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T06:09:31Z","timestamp":1592114971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-010-9367-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9367"],"URL":"https:\/\/doi.org\/10.1007\/s10878-010-9367-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,1]]}}}