On the Quest for an Acyclic Graph
Logic in Computer Science
2017-10-10 v2
Abstract
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula {\phi} over edges of a fixed-size graph, the objective is to find a model of {\phi} 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.
Cite
@article{arxiv.1708.01745,
title = {On the Quest for an Acyclic Graph},
author = {Mikolas Janota and Radu Grigore and Vasco Manquinho},
journal= {arXiv preprint arXiv:1708.01745},
year = {2017}
}
Comments
RCRA2017