{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:36Z","timestamp":1725543996090},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343066"},{"type":"electronic","value":"9783540343073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11757375_5","type":"book-chapter","created":{"date-parts":[[2006,5,19]],"date-time":"2006-05-19T07:59:15Z","timestamp":1148025555000},"page":"29-43","source":"Crossref","is-referenced-by-count":7,"title":["Undirected Forest Constraints"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[]},{"given":"Irit","family":"Katriel","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Lorca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","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":"5_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J.-L. Lauri\u00e8re","year":"1978","unstructured":"Lauri\u00e8re, J.-L.: A language and a program for stating and solving combinatorial problems. Artificial Intelligence\u00a010, 29\u2013127 (1978)","journal-title":"Artificial Intelligence"},{"issue":"12","key":"5_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraint in CHIP. Mathl. Comput. Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Mathl. Comput. Modelling"},{"key":"5_CR4","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":"5_CR5","unstructured":"Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The Constraint Logic Programming Language CHIP. In: Int. Conf. on Fifth Generation Computer Systems (FGCS 1988), Tokyo, Japan, pp. 693\u2013702 (1988)"},{"key":"5_CR6","unstructured":"Puget, J.-F.: A C++ Implementation of CLP. In: Second Singapore International Conference on Intelligent Systems (SPICIS), Singapore, November 1994, pp. 256\u2013261 (1994)"},{"key":"5_CR7","first-page":"376","volume":"23","author":"A. Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Quart. J. Math.\u00a023, 376\u2013378 (1889)","journal-title":"Quart. J. Math."},{"key":"5_CR8","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., K\u0131z\u0131ltan, Z., Walsh, T.: The range and roots Constraints: Specifying Counting and Occurrence Problems. In: IJCAI 2005, pp. 60\u201365 (2005)"},{"key":"5_CR9","unstructured":"Berge, C.: Graphes, 2nd edn. Dunod, New York (1985) (in French)"},{"key":"5_CR10","unstructured":"Sellmann, M.: Reduction techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn (2002)"},{"key":"5_CR11","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSP. In: AAAI 1994, pp. 362\u2013367 (1994)"},{"key":"5_CR12","unstructured":"Gondran, M., Minoux, M.: Graphes et algorithmes, 2nd edn. Eyrolles, Paris (1985) (in French)"},{"key":"5_CR13","first-page":"17","volume-title":"FOCS 1980","author":"S. Micali","year":"1980","unstructured":"Micali, S., Vazirani, V.V.: An \n                    \n                      \n                    \n                    $\\mathcal{O}(\\sqrt{|V|} \\cdot |{E}|)$\n                   algorithm for finding maximum matching in general graphs. In: FOCS 1980, New York, pp. 17\u201327. IEEE, Los Alamitos (1980)"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/11564751_56","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Petit, T., Rochart, G.: Bounds of Graph Characteristics. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 742\u2013746. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11757375_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:14Z","timestamp":1619507054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11757375_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343066","9783540343073"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11757375_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}