{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:23:45Z","timestamp":1648646625507},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,6,30]],"date-time":"2013-06-30T00:00:00Z","timestamp":1372550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10100-013-0309-4","type":"journal-article","created":{"date-parts":[[2013,6,29]],"date-time":"2013-06-29T09:13:08Z","timestamp":1372497188000},"page":"149-185","source":"Crossref","is-referenced-by-count":2,"title":["Gallai-Edmonds decomposition as a pruning technique"],"prefix":"10.1007","volume":"23","author":[{"given":"Rados\u0142aw","family":"Cymer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,6,30]]},"reference":[{"key":"309_CR1","doi-asserted-by":"crossref","unstructured":"Althaus E, Bockmayr A, Elf M, Kasper T, J\u00fcnger M, Mehlhorn K (2002) SCIL-symbolic constraints in integer linear programming. Lecture Notes Comput Sci 2461:75\u201387","DOI":"10.1007\/3-540-45749-6_11"},{"key":"309_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"KR Apt","year":"2003","unstructured":"Apt KR (2003) Principles of constraint programming. Cambridge University Press, Cambridge"},{"key":"309_CR3","unstructured":"Beldiceanu N, Carlsson M, Rampon J-X (2012) Global constraint catalog. Technical Report T2012\u201303, Swedish Institute of Computer Science, October 4"},{"key":"309_CR4","doi-asserted-by":"crossref","unstructured":"Beldiceanu N, Contejean E (1994) Introducing global constraints in CHIP. Math Comput Model 20(12): 97\u2013123","DOI":"10.1016\/0895-7177(94)90127-9"},{"key":"309_CR5","doi-asserted-by":"crossref","unstructured":"Beldiceanu N, Katriel I, Lorca X (2006) Undirected forest constraints. Lecture Notes Comput Sci 3990: 29\u201343","DOI":"10.1007\/11757375_5"},{"key":"309_CR6","doi-asserted-by":"crossref","unstructured":"Beldiceanu N, Petit T (2004) Cost evaluation of soft global constraints. Lecture Notes Comput Sci 3011: 80\u201395","DOI":"10.1007\/978-3-540-24664-0_6"},{"key":"309_CR7","unstructured":"Beldiceanu N, Simonis H (2012) A model seeker. Description and detailed results. Update of Technical Report 4C-2012-01, Cork Constraint Computation Centre, University College Cork, 19 May 2012 (unpublished)"},{"key":"309_CR8","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge C (1957) Two theorems in graph theory. Proc Natl Acad Sci USA 43:842\u2013844","journal-title":"Proc Natl Acad Sci USA"},{"key":"309_CR9","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms, 2nd edn. MIT Press, Cambridge, MA","edition":"2"},{"issue":"3","key":"309_CR10","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/s10601-012-9120-4","volume":"17","author":"R Cymer","year":"2012","unstructured":"Cymer R (2012) Dulmage-Mendelsohn canonical decomposition as a generic pruning technique. Constraints 17(3):234\u2013272","journal-title":"Constraints"},{"key":"309_CR11","volume-title":"Constraint processing","author":"R Dechter","year":"2003","unstructured":"Dechter R (2003) Constraint processing. Morgan Kaufmann Publishers, USA"},{"key":"309_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Paths, trees and flowers. Can J Math 17:449\u2013467","journal-title":"Can J Math"},{"issue":"2","key":"309_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","volume":"23","author":"HN Gabow","year":"1976","unstructured":"Gabow HN (1976) An efficient implementation of Edmonds\u2019 algorithm for maximum matching on graphs. J Assoc Comput Mach 23(2):221\u2013234","journal-title":"J Assoc Comput Mach"},{"key":"309_CR14","doi-asserted-by":"crossref","unstructured":"Gabow HN (1983) An efficient reduction technique for degree-constrained subgraph and bidirected network flow problem. In: Proceedings of the 15th annual ACM symposium on theory of computing, New York, pp 448\u2013456","DOI":"10.1145\/800061.808776"},{"key":"309_CR15","unstructured":"Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of the 1st annual ACM-SIAM symposium on discrete algorithms, Philadephia, pp 434\u2013443"},{"key":"309_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow HN, Tarjan RE (1985) A linear-time algorithm for a special case of disjoint set union. J Comput Syst Sci 30:209\u2013221","journal-title":"J Comput Syst Sci"},{"key":"309_CR17","first-page":"373","volume":"8","author":"T Gallai","year":"1963","unstructured":"Gallai T (1963) Kritische Graphen II. Magyar Tudom\u00e1nyos Akad\u00e9mia; Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 8:373\u2013395","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia; Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"309_CR18","first-page":"401","volume":"9","author":"T Gallai","year":"1964","unstructured":"Gallai T (1964) Maximale Systeme unabh\u00e4ngiger Kanten. Magyar Tudom\u00e1nyos Akad\u00e9mia; Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei 9:401\u2013413","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia; Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"309_CR19","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA"},{"key":"309_CR20","doi-asserted-by":"crossref","unstructured":"Henz M, M\u00fcller T, Thiel S (2004) Global constraints for round robin tournament scheduling. Eur J Oper Res 1(153):92\u2013101","DOI":"10.1016\/S0377-2217(03)00101-2"},{"key":"309_CR21","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L. (1987) Matching structure and the matching lattice. J Comb Theory (B) 43:187\u2013222","DOI":"10.1016\/0095-8956(87)90021-9"},{"key":"309_CR22","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Annals of discrete mathematics (29). North-Holland, Amsterdam"},{"key":"309_CR23","volume-title":"LEDA: a platform for combinatorial and geometric computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn K, N\u00e4her S (1999) LEDA: a platform for combinatorial and geometric computing. Cambridge University Press, Cambridge"},{"key":"309_CR24","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ipl.2009.02.013","volume":"109","author":"H Meijer","year":"2009","unstructured":"Meijer H, N\u00fa\u00f1ez-Rodr\u00edguez Y, Rappaport D (2009) An algorithm for computing simple k-factors. Inf Process Lett 109:620\u2013625","journal-title":"Inf Process Lett"},{"key":"309_CR25","unstructured":"Micali S, Vazirani VV (1980) An $$O(\\sqrt{|V|}\\cdot |E|)$$ O ( | V | \u00b7 | E | ) algorithm for finding maximum matching in general graphs. In: Proceedings of the 21st annual symposium on foundations of computer science, pp 17\u201327"},{"key":"309_CR26","doi-asserted-by":"crossref","unstructured":"Norman RZ, Rabin MO (1959) An algorithm for a minimum cover of a graph. Proc Am Math Soc 10: 315\u2013319","DOI":"10.1090\/S0002-9939-1959-0106853-5"},{"key":"309_CR27","doi-asserted-by":"crossref","unstructured":"Petersen J (1891) Die Theorie der regul\u00e4ren Graphen. Acta Math 15:193\u2013220","DOI":"10.1007\/BF02392606"},{"key":"309_CR28","doi-asserted-by":"crossref","unstructured":"Petit T, R\u00e9gin J-C, Bessi\u00e8re C (2001) Specific filtering algorithms for over-constrained problems. Lecture Notes Comput Sci 2239:451\u2013463","DOI":"10.1007\/3-540-45578-7_31"},{"key":"309_CR29","unstructured":"R\u00e9gin J.C. (1999) The symmetric alldiff constraint. In: Proceedings of the 16th international joint conference on artificial intelligence (IJCAI-99), pp 420\u2013425"},{"key":"309_CR30","doi-asserted-by":"crossref","unstructured":"R\u00e9gin J-C, Petit T, Bessiere C, Puget J-F (2000) An original constraint based approach for solving over constrained problems. Lecture Notes Comput Sci 1894:543\u2013548","DOI":"10.1007\/3-540-45349-0_46"},{"key":"309_CR31","doi-asserted-by":"crossref","unstructured":"Tarjan RE (1983) Data structures and network algorithms. SIAM Press, Philadelphia, PA","DOI":"10.1137\/1.9781611970265"},{"key":"309_CR32","doi-asserted-by":"crossref","unstructured":"Trick MA (2003) Integer and constraint programming approaches for round-robin tournament scheduling. Lecture Notes Comput Sci 2740:63\u201377","DOI":"10.1007\/978-3-540-45157-0_4"},{"key":"309_CR33","volume-title":"Foundations of constraint satisfaction","author":"E Tsang","year":"1993","unstructured":"Tsang E (1993) Foundations of constraint satisfaction. Academic Press, New York"},{"key":"309_CR34","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"WT Tutte","year":"1954","unstructured":"Tutte WT (1954) A short proof of the factor theorem for finite graphs. Can J Math 6:347\u2013352","journal-title":"Can J Math"},{"key":"309_CR35","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579180","volume":"1","author":"WT Tutte","year":"1981","unstructured":"Tutte WT (1981) Graph factors. Combinatorica 1:79\u201397","journal-title":"Combinatorica"},{"key":"309_CR36","unstructured":"van Hoeve W-J (2001) The alldifferent constraint: a survey. In: Proceedings of the 6th annual workshop of the ERCIM working group on constraints, Prague, Czech Republic"},{"key":"309_CR37","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01305952","volume":"14","author":"VV Vazirani","year":"1994","unstructured":"Vazirani VV (1994) A theory of alternating paths and blossoms for proving correctness of the $$O(\\sqrt{|V|}\\cdot |E|)$$ O ( | V | \u00b7 | E | ) general graph maximum matching algorithm. Combinatorica 14:71\u2013109","journal-title":"Combinatorica"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0309-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-013-0309-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-013-0309-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T18:54:02Z","timestamp":1563303242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-013-0309-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6,30]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["309"],"URL":"https:\/\/doi.org\/10.1007\/s10100-013-0309-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6,30]]}}}