{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:16:44Z","timestamp":1725603404752},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642237850"},{"type":"electronic","value":"9783642237867"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23786-7_22","type":"book-chapter","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T07:58:42Z","timestamp":1314777522000},"page":"271-285","source":"Crossref","is-referenced-by-count":5,"title":["Revisiting the tree Constraint"],"prefix":"10.1007","author":[{"given":"Jean-Guillaume","family":"Fages","sequence":"first","affiliation":[]},{"given":"Xavier","family":"Lorca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N. Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., Petit, T.: Global Constraint Catalog: Past, Present and Future. Constraints\u00a012(1), 21\u201362 (2007)","journal-title":"Constraints"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11493853_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Flener, P., Lorca, X.: The tree constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 64\u201378. Springer, Heidelberg (2005)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1145\/295656.295663","volume":"20","author":"A.L. Buchsbaum","year":"1998","unstructured":"Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: A new, simpler linear-time dominators algorithm. ACM Transactions on Programming Languages and Systems\u00a020, 1265\u20131296 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/11564751_18","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"G. Dooms","year":"2005","unstructured":"Dooms, G., Deville, Y., Dupont, P.: CP(graph): Introducing a graph computation domain in constraint programming. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 211\u2013225. Springer, Heidelberg (2005)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-17458-2_14","volume-title":"Combinatorial Optimization and Applications","author":"G.F. Italiano","year":"2010","unstructured":"Italiano, G.F., Laura, L., Santaroni, F.: Finding Strong Bridges and Strong Articulation Points in Linear Time. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part I. LNCS, vol.\u00a06508, pp. 157\u2013169. Springer, Heidelberg (2010)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Lengauer, T., Tarjan, R.E.: A fast algorithm for finding dominators in a flowgraph. TOPLAS\u00a01(1) (1979)","DOI":"10.1145\/357062.357071"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-01929-6_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J. Menana","year":"2009","unstructured":"Menana, J., Demassey, S.: Sequencing and counting with the multicost-regular constraint. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol.\u00a05547, pp. 178\u2013192. Springer, Heidelberg (2009)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"22_CR10","unstructured":"Quesada, L.: Solving constrained graph problems using reachability constraints based on transitive closure and dominators. PhD thesis, Universit\u00e9 Catholique de Louvain (2006)"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/11603023_6","volume-title":"Practical Aspects of Declarative Languages","author":"L. Quesada","year":"2005","unstructured":"Quesada, L., van Roy, P., Deville, Y., Collet, R.: Using dominators for solving constrained path problems. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 73\u201387. Springer, Heidelberg (2005)"},{"key":"22_CR12","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"22_CR13","unstructured":"R\u00e9gin, J.-C.: Generalized arc consistency for global cardinality constraint. In: AAAI 1996, pp. 209\u2013215 (1996)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-68155-7_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2008","unstructured":"R\u00e9gin, J.-C.: Simpler and incremental consistency checking and arc consistency filtering algorithm for the weighted tree constraint. In: Trick, M.A. (ed.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 233\u2013247. Springer, Heidelberg (2008)"},{"issue":"6","key":"22_CR15","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/S0097539797317263","volume":"28","author":"P.W. Lauridsen","year":"1999","unstructured":"Lauridsen, P.W., Alstrup, S., Harel, D., Thorup, M.: Dominators in linear time. SIAM J. Comput.\u00a028(6), 2117\u20132132 (1999)","journal-title":"SIAM J. Comput."},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-540-45193-8_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"M. Sellmann","year":"2003","unstructured":"Sellmann, M.: Cost-based filtering for shortest path constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 694\u2013708. Springer, Heidelberg (2003)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24664-0_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"S. Sorlin","year":"2004","unstructured":"Sorlin, S., Solnon, C.: A global constraint for graph isomorphism problems. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 287\u2013301. Springer, Heidelberg (2004)"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1007\/978-3-540-74970-7_51","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Zampelli","year":"2007","unstructured":"Zampelli, S., Devilles, Y., Solnon, C., Sorlin, S., Dupont, P.: Filtering for subgraph isomorphism. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 728\u2013742. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23786-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T16:36:34Z","timestamp":1560530194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23786-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642237850","9783642237867"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23786-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}