901 research outputs found
Minimum feedback vertex set and acyclic coloring
International audienceIn the feedback vertex set problem, the aim is to minimize, in a connected graph G =(V,E), the cardinality of the set overline(V) (G) \subseteq V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in G). Then, using results from acyclic coloring, as well as other techniques, we are able to derive new lower and upper bounds on the cardinality of a minimum feedback vertex set in large families of graphs, such as graphs of maximum degree 3, of maximum degree 4, planar graphs, outerplanar graphs, 1-planar graphs, k-trees, etc. Some of these bounds are tight (outerplanar graphs, k-trees), all the others differ by a multiplicative constant never exceeding 2
Minimum feedback vertex set and acyclic coloring
International audienceIn the feedback vertex set problem, the aim is to minimize, in a connected graph G =(V,E), the cardinality of the set overline(V) (G) \subseteq V , whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback vertex set problem and the acyclic coloring problem (which consists in coloring vertices of a graph G such that no two colors induce a cycle in G). Then, using results from acyclic coloring, as well as other techniques, we are able to derive new lower and upper bounds on the cardinality of a minimum feedback vertex set in large families of graphs, such as graphs of maximum degree 3, of maximum degree 4, planar graphs, outerplanar graphs, 1-planar graphs, k-trees, etc. Some of these bounds are tight (outerplanar graphs, k-trees), all the others differ by a multiplicative constant never exceeding 2
Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT
In directed graphs, we investigate the problems of finding: 1) a minimum
feedback vertex set (also called the Feedback Vertex Set problem, or MFVS), 2)
a feedback vertex set inducing an acyclic graph (also called the Vertex
2-Coloring without Monochromatic Cycles problem, or Acyclic FVS) and 3) a
minimum feedback vertex set inducing an acyclic graph (Acyclic MFVS).
We show that these problems are strongly related to (variants of) Monotone
3-SAT and Monotone NAE 3-SAT, where monotone means that all literals are in
positive form. As a consequence, we deduce several NP-completeness results on
restricted versions of these problems. In particular, we define the 2-Choice
version of an optimization problem to be its restriction where the optimum
value is known to be either D or D+1 for some integer D, and the problem is
reduced to decide which of D or D+1 is the optimum value. We show that the
2-Choice versions of MFVS, Acyclic MFVS, Min Ones Monotone 3-SAT and Min Ones
Monotone NAE 3-SAT are NP-complete. The two latter problems are the variants of
Monotone 3-SAT and respectively Monotone NAE 3-SAT requiring that the truth
assignment minimize the number of variables set to true.
Finally, we propose two classes of directed graphs for which Acyclic FVS is
polynomially solvable, namely flow reducible graphs (for which MFVS is already
known to be polynomially solvable) and C1P-digraphs (defined by an adjacency
matrix with the Consecutive Ones Property)
Complete Acyclic Colorings
We study two parameters that arise from the dichromatic number and the
vertex-arboricity in the same way that the achromatic number comes from the
chromatic number. The adichromatic number of a digraph is the largest number of
colors its vertices can be colored with such that every color induces an
acyclic subdigraph but merging any two colors yields a monochromatic directed
cycle. Similarly, the a-vertex arboricity of an undirected graph is the largest
number of colors that can be used such that every color induces a forest but
merging any two yields a monochromatic cycle. We study the relation between
these parameters and their behavior with respect to other classical parameters
such as degeneracy and most importantly feedback vertex sets.Comment: 17 pages, no figure
Acyclic Subgraphs of Planar Digraphs
An acyclic set in a digraph is a set of vertices that induces an acyclic
subgraph. In 2011, Harutyunyan conjectured that every planar digraph on
vertices without directed 2-cycles possesses an acyclic set of size at least
. We prove this conjecture for digraphs where every directed cycle has
length at least 8. More generally, if is the length of the shortest
directed cycle, we show that there exists an acyclic set of size at least .Comment: 9 page
Planar digraphs without large acyclic sets
Given a directed graph, an acyclic set is a set of vertices inducing a
subgraph with no directed cycle. In this note we show that there exist oriented
planar graphs of order for which the size of the maximum acyclic set is at
most , for any . This disproves a conjecture of
Harutyunyan and shows that a question of Albertson is best possible.Comment: 3 pages, 1 figur
Hardness of Vertex Deletion and Project Scheduling
Assuming the Unique Games Conjecture, we show strong inapproximability
results for two natural vertex deletion problems on directed graphs: for any
integer and arbitrary small , the Feedback Vertex Set
problem and the DAG Vertex Deletion problem are inapproximable within a factor
even on graphs where the vertices can be almost partitioned into
solutions. This gives a more structured and therefore stronger UGC-based
hardness result for the Feedback Vertex Set problem that is also simpler
(albeit using the "It Ain't Over Till It's Over" theorem) than the previous
hardness result.
In comparison to the classical Feedback Vertex Set problem, the DAG Vertex
Deletion problem has received little attention and, although we think it is a
natural and interesting problem, the main motivation for our inapproximability
result stems from its relationship with the classical Discrete Time-Cost
Tradeoff Problem. More specifically, our results imply that the deadline
version is NP-hard to approximate within any constant assuming the Unique Games
Conjecture. This explains the difficulty in obtaining good approximation
algorithms for that problem and further motivates previous alternative
approaches such as bicriteria approximations.Comment: 18 pages, 1 figur
Ising formulations of many NP problems
We provide Ising formulations for many NP-complete and NP-hard problems,
including all of Karp's 21 NP-complete problems. This collects and extends
mappings to the Ising model from partitioning, covering and satisfiability. In
each case, the required number of spins is at most cubic in the size of the
problem. This work may be useful in designing adiabatic quantum optimization
algorithms.Comment: 27 pages; v2: substantial revision to intro/conclusion, many more
references; v3: substantial revision and extension, to-be-published versio
- …