{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:26:14Z","timestamp":1768731974302,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642114083","type":"print"},{"value":"9783642114090","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_17","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"190-201","source":"Crossref","is-referenced-by-count":8,"title":["The k-Disjoint Paths Problem on Chordal Graphs"],"prefix":"10.1007","author":[{"given":"Frank","family":"Kammer","sequence":"first","affiliation":[]},{"given":"Torsten","family":"Tholey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Blair, J.R.S., England, R.E., Thomason, M.G.: Cliques and their separators in triangulated graphs, Tech. Report UT-CS-88-73, Dept. Comput. Sci., University of Tennessee, Knoxville (1988)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"Buneman, P.: A characterisation of rigid circuit graphs. Discrete Math.\u00a09, 205\u2013212 (1974)","journal-title":"Discrete Math."},{"key":"17_CR3","doi-asserted-by":"publisher","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.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci.\u00a010, 111\u2013121 (1980)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D.R. Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math.\u00a015, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput.\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory Ser. B\u00a016, 47\u201356 (1974)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R.M. Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks\u00a05, 45\u201368 (1975)","journal-title":"Networks"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/3-540-50517-2_70","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S.V. Krishnan","year":"1988","unstructured":"Krishnan, S.V., Pandu Rangan, C., Seshadri, S.: A new linear algorithm for the two path problem on chordal graphs. In: Kumar, S., Nori, K.V. (eds.) FSTTCS 1988. LNCS, vol.\u00a0338, pp. 49\u201366. Springer, Heidelberg (1988)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1061425.1061430","volume":"5","author":"J.F. Lynch","year":"1975","unstructured":"Lynch, J.F.: The equivalence of theorem proving and the interconnection problem (ACM) SIGDA Newsletter\u00a05, 31\u201336 (1975)","journal-title":"(ACM) SIGDA Newsletter"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C. Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete and Comput. Geom.\u00a026, 573\u2013590 (2001)","journal-title":"Discrete and Comput. Geom."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-10704-5_18","volume-title":"Graph Theory and Algorithms","author":"T. Ohtsuki","year":"1981","unstructured":"Ohtsuki, T.: The two disjoint path problem and wire routing design. In: Saito, N., Nishizeki, T. (eds.) Graph Theory and Algorithms. LNCS, vol.\u00a0108, pp. 207\u2013216. Springer, Heidelberg (1981)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/11604686_38","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y. Okamoto","year":"2005","unstructured":"Okamoto, Y., Uno, T., Uehara, R.: Linear-time counting algorithms for independent sets in chordal graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 433\u2013444. Springer, Heidelberg (2005)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1142\/S0129054100000247","volume":"11","author":"L. Perkovi\u0107","year":"2000","unstructured":"Perkovi\u0107, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. International Journal of Foundations of Computer Science (IJFCS)\u00a011, 365\u2013372 (2000)","journal-title":"International Journal of Foundations of Computer Science (IJFCS)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/322047.322048","volume":"25","author":"Y. Perl","year":"1978","unstructured":"Perl, Y., Shiloach, Y.: Finding two disjoint paths between two pairs of vertices in a graph. J. ACM\u00a025, 1\u20139 (1978)","journal-title":"J. ACM"},{"key":"17_CR15","volume-title":"Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems","author":"F.S. Roberts","year":"1976","unstructured":"Roberts, F.S.: Discrete Mathematical Models with Applications to Social, Biological, and Environmental Problems. Prentice Hall, Englewood Cliffs (1976)"},{"key":"17_CR16","unstructured":"Scheffler, P.: A practical linear time algorithm for disjoint paths in graphs with bounded tree-width, Report No. 396\/1994, TU Berlin, FB Mathematik (1994)"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P.D. Seymour","year":"1980","unstructured":"Seymour, P.D.: Disjoint paths in graphs. Discrete Math.\u00a029, 293\u2013309 (1980)","journal-title":"Discrete Math."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Shiloach, Y.: A polynomial solution to the undirected two paths problem. J. ACM\u00a027, 445\u2013456 (1980)","journal-title":"J. ACM"},{"key":"17_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","volume":"1","author":"C. Thomassen","year":"1980","unstructured":"Thomassen, C.: 2-linked graphs. European J. Combin.\u00a01, 371\u2013378 (1980)","journal-title":"European J. Combin."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/jgt.3190020311","volume":"2","author":"J.R. Walter","year":"1978","unstructured":"Walter, J.R.: Representations of chordal graphs as subtrees of a tree. J. Graph Theory\u00a02, 265\u2013267 (1978)","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11409-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:00Z","timestamp":1619783520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}