{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T21:55:30Z","timestamp":1782770130507,"version":"3.54.5"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0166-218x(93)e0177-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:14:35Z","timestamp":1027649675000},"page":"83-90","source":"Crossref","is-referenced-by-count":70,"title":["NP-completeness of some edge-disjoint paths problems"],"prefix":"10.1016","volume":"61","author":[{"given":"Jens","family":"Vygen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0177-Z_BIB1","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB2","series-title":"Paths, Flows, and VLSI-Layout","article-title":"Packing paths, circuits and cuts \u2014 a survey","author":"Frank","year":"1990"},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB3","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0404009","article-title":"Weak three-linking in Eulerian digraphs","volume":"4","author":"Ibaraki","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB4","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0166-218X(87)80002-1","article-title":"Half-integral five-terminus-flows","volume":"18","author":"Karzanov","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB5","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","article-title":"A minimax relation for directed graphs","volume":"17","author":"Lucchesi","year":"1978","journal-title":"J. London Math. Soc. (2)"},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01202792","article-title":"On the complexity of the disjoint path problem","volume":"13","author":"Middendorf","year":"1993","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","article-title":"Multicommodity flows in planar graphs","volume":"31","author":"Okamura","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB8","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1287\/opre.14.6.1121","article-title":"Feasibility of two-commodity network flows","volume":"14","author":"Rothschild","year":"1966","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB9","series-title":"Disjoint paths in directed graphs","author":"Vygen","year":"1992"},{"key":"10.1016\/0166-218X(93)E0177-Z_BIB10","article-title":"Disjoint paths","author":"Vygen","year":"1994"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0177Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0177Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:55:14Z","timestamp":1555278914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0177Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["0166218X93E0177Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0177-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}