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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11564751_10 | LECTURE NOTES IN COMPUTER SCIENCE |
Keywords | Field | DocType |
graph invariant.,implied constraint,global constraint | Discrete mathematics,Graph property,Computer science,Constraint graph,Null graph,Graph rewriting,Algebraic graph theory,Extremal graph theory,Voltage graph,Graph (abstract data type) | Conference |
Volume | ISSN | Citations |
3709 | 0302-9743 | 5 |
PageRank | References | Authors |
0.58 | 8 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nicolas Beldiceanu | 1 | 547 | 51.14 |
Mats Carlsson | 2 | 975 | 79.24 |
Jean-Xavier Rampon | 3 | 86 | 15.03 |
Charlotte Truchet | 4 | 63 | 11.48 |