An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph
نویسندگان
چکیده
The feedback vertex set (FVS) problem is to find the set of vertices of minimum cardinality whose removal renders the graph acyclic. The FVS problem has applications in several areas such as combinatorial circuit design, synchronous systems, computer systems, and very-large-scale integration (VLSI) circuits. The FVS problem is known to be NP-hard for simple graphs, but polynomial-time algorithms have been found for special classes of graphs. The intersection graph of a collection of arcs on a circle is called a circular-arc graph. A normal Helly circular-arc graph is a proper subclass of the set of circular-arc graphs. In this paper, we present an algorithm that takes ( ) O n m + time to solve the FVS problem in a normal Helly circular-arc graph with n vertices and m
منابع مشابه
Essential obstacles to Helly circular-arc graphs
A Helly circular-arc graph is the intersection graph of a set of arcs on a circle having the Helly property. We introduce essential obstacles, which are a refinement of the notion of obstacles, and prove that essential obstacles are precisely the minimal forbidden induced circular-arc subgraphs for the class of Helly circular-arc graphs. We show that it is possible to find in linear time, in an...
متن کاملOn circular-arc graphs having a model with no three arcs covering the circle
An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval graphs was found fifty years ago, finding an analogous characterization for circular-arc graphs is a long-standing open problem. In this work, we study the inters...
متن کاملNormal Helly circular-arc graphs and its subclasses
A Helly circular-arc modelM = (C,A) is a circle C together with a Helly family A of arcs of C. If no arc is contained in any other, thenM is a proper Helly circular-arc model, if every arc has the same length, then M is a unit Helly circular-arc model, and if there are no two arcs covering the circle, thenM is a normal Helly circular-arc model. A Helly (resp. proper Helly, unit Helly, normal He...
متن کاملForbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection
A normal Helly circular-arc graph is the intersection graph of arcs on a circle of which no three or less arcs cover the whole circle. Lin, Soulignac, and Szwarcfiter [Discrete Appl. Math. 2013] characterized circular-arc graphs that are not normal Helly circular-arc graphs, and used it to develop the first recognition algorithm for this graph class. As open problems, they ask for the forbidden...
متن کاملClique-independent sets of Helly circular-arc graphs
A circular-arc graph is the intersection graph of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose al...
متن کامل