Mikolas, Janota, Radu, Grigore, Vasco, Manquinho (2017) On the Quest for an Acyclic Graph. In: 24th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion", 14-15 Nov 2017, Bari, Italy. (Unpublished) (KAR id:67090)
|
PDF
Author's Accepted Manuscript
Language: English |
|
|
Download this file (PDF/436kB) |
Preview |
| Request a format suitable for use with assistive technology e.g. a screenreader | |
| Additional URLs: |
|
Abstract
The paper aims at finding acyclic graphs under a given set of
constraints. More specifically, given a propositional formula
? over edges of a fixed-size graph, the objective is to find a model of
? that corresponds to a graph that is acyclic. The paper proposes several encodings of the
problem and compares them in an experimental evaluation using stateof-the-art
SAT solvers.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Institutional Unit: | Schools > School of Computing |
| Former Institutional Unit: |
Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
|
| Depositing User: | Radu Grigore |
| Date Deposited: | 18 May 2018 13:59 UTC |
| Last Modified: | 20 May 2025 10:21 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/67090 (The current URI for this page, for reference purposes) |
University of Kent Author Information
Radu, Grigore.
| Creator's ORCID: |
 https://orcid.org/0000-0003-1128-0311
|
|---|---|
| CReDIT Contributor Roles: |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Total Views
Total Views
