{"type":"ScholarlyArticle","title":"Fast Algorithm for Connected Row Convex Constraints","authors":[{"name":"Yuanlin Zhang","slug":"yuanlin-zhang","given":"Yuanlin","family":"Zhang","affiliation":""}],"abstract":"Many interesting tractable problems are identified under the model of Constraint Satisfaction Problems. These problems are usually solved by forcing a certain level of local consistency. In this paper, for the class of connected row convex constraints, we propose a novel algorithm which is based on the ideas of variable elimination and efficient composition of row convex and connected constraints. Compared with the existing work including randomized algorithms, the new algorithm has better worst case time and space complexity.","doi":null,"url":"https://ijcai.org/proceedings/2007/29","pdf":"https://ijcai.org/proceedings/2007/0029.pdf","markdown":"https://ijcai.org/proceedings/2007/29.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/29","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":29,"pages":{"first":192,"last":196},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}