{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:23:25Z","timestamp":1774369405720,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759074","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"826-839","source":"Crossref","is-referenced-by-count":21,"title":["Chain packing in graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Shigeru","family":"Masuyama","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01759074_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass. (1974)."},{"key":"BF01759074_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and Hypergraphs, North-Holland, Amsterdam (1973)."},{"key":"BF01759074_CR3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","volume":"24","author":"F. T. Boesch","year":"1977","unstructured":"F. T. Boesch and J. F. Gimpel, Covering the points of a digraph with point-disjoint paths and its application to code optimization,J. Assoc. Comput. Mach.,24 (1977), 192\u2013198.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01759074_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","volume":"4","author":"G. Cornuejols","year":"1982","unstructured":"G. Cornuejols, D. Hartvigsen, and W. R. Pulleyblank, Packing subgraphs in a graph,Oper. Res. Lett.,4 (1982), 139\u2013143.","journal-title":"Oper. Res. Lett."},{"key":"BF01759074_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco (1979)."},{"key":"BF01759074_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary,Graph Theory, Addison-Wesley, Reading, Mass. (1969)."},{"key":"BF01759074_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(81)90073-9","volume":"12","author":"P. Hell","year":"1981","unstructured":"P. Hell and D. G. Kirkpatrick, On generalized matching problems,Inform. Process. Lett.,12 (1981), 33\u201335.","journal-title":"Inform. Process. Lett."},{"key":"BF01759074_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0012-365X(84)90150-X","volume":"49","author":"P. Hell","year":"1984","unstructured":"P. Hell and D. G. Kirkpatrick, Packings by cliques and by. finite families of graphs,Discrete Math.,49 (1984), 45\u201399.","journal-title":"Discrete Math."},{"key":"BF01759074_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/0607024","volume":"7","author":"P. Hell","year":"1986","unstructured":"P. Hell and D. G. Kirkpatrick, Packings by complete bipartite graphs,SIAM J. Algebraic Discrete Methods,7 (1986), 199\u2013209.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01759074_CR10","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer, The NP-completeness of some edge-partition problems,SIAM J. Comput.,10 (1981), 713\u2013717.","journal-title":"SIAM J. Comput."},{"key":"BF01759074_CR11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1002\/jgt.3190090416","volume":"9","author":"M. J\u00fcnger","year":"1985","unstructured":"M. J\u00fcnger, G. Reinelt, and W. R. Pulleyblank, On partitioning the edges of graphs into connected subgraphs,J. Graph Theory,9 (1985), 539\u2013549.","journal-title":"J. Graph Theory"},{"key":"BF01759074_CR12","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick and P. Hell, On the complexity of general graph factor problems,SIAM J. Comput,12 (1983), 601\u2013609.","journal-title":"SIAM J. Comput"},{"key":"BF01759074_CR13","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, and Winston, New York (1976)."},{"key":"BF01759074_CR14","series-title":"Technical Report No.","volume-title":"On the tree packing problem","author":"S. Masuyama","year":"1987","unstructured":"S. Masuyama, On the tree packing problem, Technical Report No. 87014, Dept. of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606 (1987); to appear inDiscrete Appl. Math."},{"key":"BF01759074_CR15","series-title":"Technical Report No.","volume-title":"Computational complexity of chain packing problems","author":"S. Masuyama","year":"1987","unstructured":"S. Masuyama and T. Ibaraki, Computational complexity of chain packing problems, Technical Report No. 87001, Dept. of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University, Kyoto 606 (1987)."},{"key":"BF01759074_CR16","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"R. E. Tarjan, Depth first search and linear graph algorithms,SIAM J. Comput.,1 (1972), 146\u2013160.","journal-title":"SIAM J. Comput."},{"key":"BF01759074_CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W. T. Tutte","year":"1947","unstructured":"W. T. Tutte, The factorization of linear graphs,J. London Math. Soc.,22 (1947), 107\u2013111.","journal-title":"J. London Math. Soc."},{"key":"BF01759074_CR18","first-page":"206","volume":"49","author":"Z. Z. Zhang","year":"1987","unstructured":"Z. Z. Zhang, S. Masuyama, T. Ibaraki, and H. Mine, Graph packing over a rooted tree,Mem. Fac. Engrg. Kyoto Univ.,49, (1987), 206\u2013215.","journal-title":"Mem. Fac. Engrg. Kyoto Univ."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759074\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T16:25:44Z","timestamp":1557332744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":18,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759074"],"URL":"https:\/\/doi.org\/10.1007\/bf01759074","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}