{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:20:38Z","timestamp":1761805238679},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309475"},{"type":"electronic","value":"9783540316855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11603023_6","type":"book-chapter","created":{"date-parts":[[2005,12,22]],"date-time":"2005-12-22T13:45:28Z","timestamp":1135259128000},"page":"73-87","source":"Crossref","is-referenced-by-count":11,"title":["Using Dominators for Solving Constrained Path Problems"],"prefix":"10.1007","author":[{"given":"Luis","family":"Quesada","sequence":"first","affiliation":[]},{"given":"Peter","family":"Van Roy","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Rapha\u00ebl","family":"Collet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Principles of Compiler Design","author":"A.V. Aho","year":"1977","unstructured":"Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Addison-Wesley, Reading (1977)"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contjean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a012, 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"6_CR3","unstructured":"Bourreau, E.: Traitement de contraintes sur les graphes en programmation par contraintes. Doctoral dissertation, Universit\u00e9 Paris, Paris, France (1999)"},{"key":"6_CR4","unstructured":"Cambazard, H., Bourreau, E.: Conception d\u2019une contrainte globale de chemin. In: 10e Journ\u00e9es nationales sur la r\u00e9solution pratique de probl\u00e8mes NP-complets (JNPC 2004), Angers, France, pp. 107\u2013121 (June 2004)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Caseau, Y., Laburthe, F.: Solving small TSPs with constraints. In: International Conference on Logic Programming, pp. 316\u2013330 (1997)","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"6_CR6","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"key":"6_CR7","unstructured":"Dooms, G., Deville, Y., Dupont, P.: Constrained path finding in biochemical networks. In: 5\u00e8mes Journ\u00e9es Ouvertes Biologie Informatique Math\u00e9matiques (2004)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Dooms, G., Deville, Y., Dupont, P.: CP(Graph):introducing a graph computation domain in constraint programming. In: CP 2005 Proceedings (2005)","DOI":"10.1007\/11564751_18"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Demetrescu, C., Italiano, G.F.: Fully dynamic transitive closure: Breaking through the O(n 2) barrier. In: IEEE Symposium on Foundations of Computer Science, pp. 381\u2013389 (2000)","DOI":"10.1109\/SFCS.2000.892126"},{"key":"6_CR10","unstructured":"A disjoint-paths problem solved with Reachability. Available at, http:\/\/www.info.ucl.ac.be\/~luque\/PADL06\/DPcase.ps"},{"key":"6_CR11","unstructured":"Focacci, F., Lodi, A., Milano, M.: Solving tsp with time windows with constraints. In: CLP 1999 International Conference on Logic Programming Proceedings (1999)"},{"key":"6_CR12","volume-title":"Computers and Intractability: A Guide to the The Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the The Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/357062.357071","volume":"1","author":"T. Lengauer","year":"1979","unstructured":"Lengauer, T., Tarjan, R.: A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems\u00a01(1), 121\u2013141 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR14","unstructured":"Consortium, M.: The Mozart Programming System, version 1.3.0 (2004), Available at, http:\/\/www.mozart-oz.org\/"},{"key":"6_CR15","unstructured":"M\u00fcller, T.: Constraint Propagation in Mozart. Doctoral dissertation, Universit\u00e4t des Saarlandes, Naturwissenschaftlich-Technische Fakult\u00e4t I, Fachrichtung Informatik, Saarbr\u00fccken, Germany (2001)"},{"key":"6_CR16","unstructured":"Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the travelling salesman with time windows (1996)"},{"key":"6_CR17","unstructured":"Quesada, L., van Roy, P., Deville, Y.: Reachability: a constrained path propagator implemented as a multi-agent system. In: CLEI 2005 Proceedings (2005)"},{"key":"6_CR18","unstructured":"Quesada, L., van Roy, P., Deville, Y.: The reachability propagator. Research Report INFO-2005-07, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium (2005)"},{"key":"6_CR19","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in csps. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 362\u2013367 (1994)"},{"key":"6_CR20","unstructured":"Schulte, C.: Programming Constraint Services. Doctoral dissertation, Universit\u00e4t des Saarlandes, Naturwissenschaftlich-Technische Fakult\u00e4t I, Fachrichtung Informatik, Saarbr\u00fccken, Germany (2000)"},{"key":"6_CR21","unstructured":"Sellmann, M.: Reduction Techniques in Constraint Programming and Combinatorial Optimization. Doctoral dissertation, University of Paderborn, Paderborn, Germany (2002)"},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/244795.244799","volume":"19","author":"V.C. Sreedhar","year":"1997","unstructured":"Sreedhar, V.C., Gao, G.R., Lee, Y.-F.: Incremental computation of dominator trees. ACM Transactions on Programming Languages and Systems\u00a019(2), 239\u2013252 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Shiloach, Y., Perl, Y.: Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM (1978)","DOI":"10.1145\/322047.322048"},{"key":"6_CR24","unstructured":"Spmn_22. Available at, http:\/\/www.info.ucl.ac.be\/~luque\/PADL06\/test_22.ps"},{"key":"6_CR25","unstructured":"Spmn_22full. Available at, http:\/\/www.info.ucl.ac.be\/~luque\/PADL06\/test_22full.ps"},{"key":"6_CR26","unstructured":"Spmn_52a. Available at, http:\/\/www.info.ucl.ac.be\/~luque\/PADL06\/test_52.ps"},{"key":"6_CR27","unstructured":"Spmn_52full. Available at, http:\/\/www.info.ucl.ac.be\/~luque\/PADL06\/test_52full.ps"},{"key":"6_CR28","volume-title":"Concepts, Techniques, and Models of Computer Programming","author":"P. Roy Van","year":"2003","unstructured":"Van Roy, P., Haridi, S.: Concepts, Techniques, and Models of Computer Programming. The MIT Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11603023_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T22:07:23Z","timestamp":1706825243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11603023_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309475","9783540316855"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11603023_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}