{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:34:41Z","timestamp":1648679681463},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01432363","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T23:46:06Z","timestamp":1113263166000},"page":"325-346","source":"Crossref","is-referenced-by-count":0,"title":["Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results"],"prefix":"10.1007","volume":"41","author":[{"given":"F.","family":"Margot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Prodon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Th. M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0607033","volume":"7","author":"S Arnborg","year":"1986","unstructured":"Arnborg S, Proskurowski A (1986) Characterization and recognition of partial 3-trees. SIAM J Alg Disc Meth 7:303?340","journal-title":"SIAM J Alg Disc Meth"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg S, Proskurowski A (1989) Linear time algorithms forNP-hard problems restricted to partialk-trees. Discrete Appl Math 23:11?24","journal-title":"Discrete Appl Math"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0196-6774(87)90039-3","volume":"8","author":"W Bern","year":"1987","unstructured":"Bern W, Lawler EL, Wong L (1987) Linear time computation of optimal subgraphs of decomposable graphs. J of Algorithms 8:216?235","journal-title":"J of Algorithms"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Bodlaender HL (1993) A linear time algorithm for finding tree-decompositions of small treewidth. Proc 25th STOC 226?234","DOI":"10.1145\/167088.167161"},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune S, Hopcroft J, Wyllie J (1980) The directed subgraph homeomorphism problem. Theoret Comput Sci 10, 2:111?121","journal-title":"Theoret Comput Sci"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp RM (1975) On the complexity of combinatorial problems. Networks 5:45?68","journal-title":"Networks"},{"key":"CR7","unstructured":"Margot F (1987) Chemins disjoints sur un 2-arbre. Diploma thesis, EPF Lausanne"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","volume":"38","author":"RK Martin","year":"1990","unstructured":"Martin RK, Rardin RL, Campbell BA (1990) Polyhedral characterization of discrete dynamic programming. Operations Research 38:127?138","journal-title":"Operations Research"},{"key":"CR9","unstructured":"Matousek J, Thomas R (1988) On the complexity of finding iso- and other morphisms for partialk-trees. Working paper"},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y Pearl","year":"1978","unstructured":"Pearl Y, Shiloach Y (1978) Finding two disjoint paths between two pairs of vertices in a graph. J of the ACM 25, 1:1?9","journal-title":"J of the ACM"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Robertson N, Seymour PD (1985) Graph minors ? A survey. London Mathematical Society Lecture Note Series 103, Cambridge University Press 153?171","DOI":"10.1017\/CBO9781107325678.009"},{"key":"CR12","unstructured":"Robertson N, Seymour PD (1988) An outline of a disjoint paths algorithm. Preprint"},{"issue":"9","key":"CR13","first-page":"49","volume":"5","author":"P Scheffler","year":"1988","unstructured":"Scheffler P (1988) Linear-time algorithms for graphs of bounded tree-width. The DISJOINTPATHS-problem. In: Graphentheorie und ihre Anwendungen, Stadt Wehlen 1988, PH Dresden, Dresd Reihe Forsch 5, 9:49?52","journal-title":"Dresd Reihe Forsch"},{"issue":"3","key":"CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y Shiloach","year":"1980","unstructured":"Shiloach Y (1980) A polynomial solution to the undirected two paths problem. J of the ACM 27, 3:445?456","journal-title":"J of the ACM"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"A Wald","year":"1983","unstructured":"Wald A, Colbourn CJ (1983) Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13:159?167","journal-title":"Networks"},{"key":"CR16","first-page":"43","volume":"50","author":"TV Wimer","year":"1985","unstructured":"Wimer TV, Hedetniemi ST, Laskar R (1985) A methodology for constructing linear graph algorithms. Congr Numerantium 50:43?60","journal-title":"Congr Numerantium"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01432363\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:45:32Z","timestamp":1556819132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01432363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01432363"],"URL":"https:\/\/doi.org\/10.1007\/bf01432363","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}