Abstract
Finding a graph with given properties occurs as a sub-problem of many important problems in A.I. and other areas of computer science. Main approaches to solving such problems include automated reasoning and constraint satisfaction methods. These can often be substantially sped up by considering only a subset of graphs for each equivalence class of isomorphic graphs, motivating the use of symmetry-breaking constraints for graphs.
We present a symmetry-breaking constraint for directed graphs, generalizing earlier works that have presented such constraints for undirected graphs without loops, and experimentally demonstrate their effectiveness.
We present a symmetry-breaking constraint for directed graphs, generalizing earlier works that have presented such constraints for undirected graphs without loops, and experimentally demonstrate their effectiveness.
| Original language | English |
|---|---|
| Title of host publication | ECAI 2024 : 27th European Conference on Artificial Intelligence, 19–24 October 2024, Santiago de Compostela, Spain – Including 13th Conference on Prestigious Applications of Intelligent Systems (PAIS 2024) |
| Publisher | IOS Press |
| Pages | 4248-4253 |
| Number of pages | 6 |
| ISBN (Electronic) | 978-1-64368-548-9 |
| Publication status | Published - 22 Oct 2024 |
| MoE publication type | A4 Conference publication |
| Event | European Conference on Artificial Intelligence - Santiago de Compostela, Spain Duration: 19 Oct 2024 → 24 Oct 2024 Conference number: 27 |
Publication series
| Name | Frontiers in Artificial Intelligence and Applications |
|---|---|
| Publisher | IOS Press |
| Volume | 392 |
| ISSN (Print) | 0922-6389 |
| ISSN (Electronic) | 1879-8314 |
Conference
| Conference | European Conference on Artificial Intelligence |
|---|---|
| Abbreviated title | ECAI |
| Country/Territory | Spain |
| City | Santiago de Compostela |
| Period | 19/10/2024 → 24/10/2024 |