Conference Proceedings

Graph invariants as necessary conditions for global constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3709 LNCS 92-106
DOI: 10.1007/11564751_10
10Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global constraints. This scheme is based on invariants on the graph characteristics used in the description of a global constraint. A SICStus Prolog implementation based on arithmetic and logical constraints as well as on indexicals is available. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Beldiceanu, N., Carlsson, M., Rampon, J. X., & Truchet, C. (2005). Graph invariants as necessary conditions for global constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 92–106). https://doi.org/10.1007/11564751_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free