Algorithms for a maximum clique and a maximum independent set of a circle graph
نویسنده
چکیده
Consider a family of chords i n a c ircle . is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. I n t h i s paper, we describe e f f i c i en t algorithms for finding a ma3cimwn clique and a maximum independent s e t of circle graphs. the number of vertices i n the graph. Key WO&: Circle graph, transi t ive graph, interval graph, permutation graph, overlap graph, maximum clique, maximum independent se t . A c irc le graph 3 These algorithms require a t most n steps, where n is
منابع مشابه
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan et al. [3]. They propose an 0(n2) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., O(n log ...
متن کامل2 Trapezoid Graphs
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. They propose an O(n 2) algorithm for chromatic number and a less eecient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, ...
متن کاملAlgorithms for clique-independent sets on subclasses of circular-arc graphs
A circular-arc graph is the intersection graph of arcs on 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 po...
متن کامل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...
متن کاملA Maximum Weight Clique Algorithm For Dense Circle Graphs With Many Shared Endpoints
Circle graphs are derived from the intersections of a set of chords. They have applications in VLSI design, bioinformatics, and chemistry. Some intractable problems on general graphs can be solved in polynomial time on circle graphs. As such, the study of circle graph algorithms has received attention. State-of-the-art algorithms for finding the maximum weight clique of a circle graph are very ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Networks
دوره 3 شماره
صفحات -
تاریخ انتشار 1973