Add to ORKGThe 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
In this paper, we employ the decomposition of a directed network as an undirected graph plus its ass...
International audienceMany constraints on graphs, e.g. the existence of a simple path between two ve...
Proof of the complexity of the acyclic 2-coloring problem The acyclic 2-coloring problem is defined ...
Abstract. Acyclicity is a recurring property of solutions to many important com-binatorial problems....
We show that the Satisfiability (SAT) problem for CNF formulas with ββ-acyclic hypergraphs can be so...
International audienceBayesian networks are probabilistic graphical models with a wide range of appl...
Central to algorithmic graph theory are the concepts of acyclicity and strongly connected components...
AbstractA coloring of a graph G is an assignment of colors to the vertices of G such that any two ve...
Summary Directed acyclic graphical models are widely used to represent complex causa...
Abstract. A subset S of vertices in a graph G is acyclic if the subgraph 〈S 〉 induced by S contains ...
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conj...
In this document are given Linear Program formulations of several graph problems related to the acyc...
AbstractTwo-terminal directed acyclic graphs (st-dags) are used to model problems in many areas and,...
In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs s...
In this paper, we employ the decomposition of a directed network as an undirected graph plus its ass...
In this paper, we employ the decomposition of a directed network as an undirected graph plus its ass...
International audienceMany constraints on graphs, e.g. the existence of a simple path between two ve...
Proof of the complexity of the acyclic 2-coloring problem The acyclic 2-coloring problem is defined ...
Abstract. Acyclicity is a recurring property of solutions to many important com-binatorial problems....
We show that the Satisfiability (SAT) problem for CNF formulas with ββ-acyclic hypergraphs can be so...
International audienceBayesian networks are probabilistic graphical models with a wide range of appl...
Central to algorithmic graph theory are the concepts of acyclicity and strongly connected components...
AbstractA coloring of a graph G is an assignment of colors to the vertices of G such that any two ve...
Summary Directed acyclic graphical models are widely used to represent complex causa...
Abstract. A subset S of vertices in a graph G is acyclic if the subgraph 〈S 〉 induced by S contains ...
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conj...
In this document are given Linear Program formulations of several graph problems related to the acyc...
AbstractTwo-terminal directed acyclic graphs (st-dags) are used to model problems in many areas and,...
In this paper we describe a generic scheme for the parallel exploration of directed acyclic graphs s...
In this paper, we employ the decomposition of a directed network as an undirected graph plus its ass...
In this paper, we employ the decomposition of a directed network as an undirected graph plus its ass...
International audienceMany constraints on graphs, e.g. the existence of a simple path between two ve...
Proof of the complexity of the acyclic 2-coloring problem The acyclic 2-coloring problem is defined ...