{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:50:45Z","timestamp":1725936645438},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_20","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:45:34Z","timestamp":1513856734000},"page":"285-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simple Paths and Cycles Avoiding Forbidden\u00a0Paths"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Mom\u00e8ge","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"20_CR1","unstructured":"Ahmed, M., Lubiw, A.: Shortest paths avoiding forbidden subpaths. In: STACS, pp. 63\u201374 (2009)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1002\/net.21490","volume":"61","author":"M Ahmed","year":"2013","unstructured":"Ahmed, M., Lubiw, A.: Shortest paths avoiding forbidden subpaths. Networks 61(4), 322\u2013334 (2013)","journal-title":"Networks"},{"issue":"6","key":"20_CR3","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"4","key":"20_CR4","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(93)90033-6","volume":"47","author":"ET Bax","year":"1993","unstructured":"Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian path problem. Inf. Process. Lett. 47(4), 203\u2013207 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. ACM 9(1), 61\u201363 (1962)","journal-title":"J. ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bellman, R.E.: Combinatorial processes and dynamic programming. In: Proceedings of 10th Symposium in Applied Mathematics, pp. 217\u2013249 (1960)","DOI":"10.1090\/psapm\/010\/0113718"},{"issue":"5","key":"20_CR7","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.dam.2005.05.028","volume":"154","author":"J B\u0142a\u017cewicz","year":"2006","unstructured":"B\u0142a\u017cewicz, J., Kasprzak, M.: Computational complexity of isothermic DNA sequencing by hybridization. Discrete Appl. Math. 154(5), 718\u2013729 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"13","key":"20_CR8","doi-asserted-by":"crossref","first-page":"2573","DOI":"10.1016\/j.dam.2008.03.014","volume":"156","author":"J B\u0142a\u017cewicz","year":"2008","unstructured":"B\u0142a\u017cewicz, J., Kasprzak, M., Leroy-Beaulieu, B., de Werra, D.: Finding Hamiltonian circuits in quasi-adjoint graphs. Discrete Appl. Math. 156(13), 2573\u20132580 (2008)","journal-title":"Discrete Appl. Math."},{"key":"20_CR9","volume-title":"Graph Theory","author":"JA Bondy","year":"2010","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, London (2010)"},{"key":"20_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"20_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0377-2217(84)90269-8","volume":"18","author":"E Queiros de","year":"1984","unstructured":"de Queiros, E., Martins, V.: An algorithm for ranking paths that may contain cycles. Eur. J. Oper. Res. 18(1), 123\u2013130 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR12","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 173rd edn. Springer, Heidelberg (2012)","edition":"173"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Gouveia, L., Patr\u00edcio, P., de Sousa, A.F., Valadas, R.: MPLS over WDM network design with packet level QOS constraints based on ILP models. In: Proceedings of IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208708"},{"issue":"1","key":"20_CR14","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-35843-2_23","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"MM Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Laforest, C., Mom\u00e8ge, B.: An exact algorithm to check the existence of (elementary) paths and a generalisation of the cut problem in graphs with forbidden transitions. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 257\u2013267. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-35843-2_23"},{"issue":"2","key":"20_CR16","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"RM Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49\u201351 (1982)","journal-title":"Oper. Res. Lett."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Kohn, S., Gottlieb, A., Kohn, M.: A generating function approach to the traveling salesman problem. In: Proceedings of the 1977 Annual Conference, ACM 1977, pp. 294\u2013300. ACM, New York (1977)","DOI":"10.1145\/800179.810218"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Lee, K., Shayman, M.A.: Optical network design with optical constraints in IP\/WDM networks. IEICE Trans. 88-B(5), 1898\u20131905 (2005)","DOI":"10.1093\/ietcom\/e88-b.5.1898"},{"issue":"2\u20133","key":"20_CR19","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0166-218X(02)00251-2","volume":"126","author":"S Szeider","year":"2003","unstructured":"Szeider, S.: Finding paths in graphs avoiding forbidden transitions. Discrete Appl. Math. 126(2\u20133), 261\u2013273 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.ejor.2004.01.032","volume":"165","author":"D Villeneuve","year":"2005","unstructured":"Villeneuve, D., Desaulniers, G.: The shortest path problem with forbidden paths. Eur. J. Oper. Res. 165(1), 97\u2013107 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR21","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T11:53:16Z","timestamp":1513857196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}