On k-Coloring of Weighted Circular-Arc Graphs
نویسندگان
چکیده
The problem of coloring a subgraph of any weighted circular-arc graph with a set of k colors is studied in this paper. In such a coloring, two overlapping arcs must receive different colors. Our main result is to derive a 2-approximation algorithm for the NP-hard problem of finding a maximum total weight k-colorable subgraph of any weighted circular-arc graph, and this algorithm runs in O(mloge m+k(2n+m)) steps.
منابع مشابه
Hadwiger's conjecture for proper circular arc graphs
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger’s conjecture states that if a graph G has chromatic number k, then a complete ...
متن کاملColoring Fuzzy Circular Interval Graphs
Given a graph G with nonnegative node labels w, a multiset of stable sets S1, . . . , Sk ⊆ V (G) such that each vertex v ∈ V (G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number χw(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring numb...
متن کاملCircular Coloring for Graphs with Distance Constraints
Let G = (V,E) be a simple un-weighted graph, and let → d= (d1, d2, · · ·, dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular r−coloring for G with distance constraint → d is a mapping f : V (G) → Sr such that |f(u) − f(v)|r ≥ di, whenever the distance between u and v in G is i (where |x− y|r is the ...
متن کاملBuffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs
In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs known as regular stream flow graphs commonly used in Digital Signal Processing applications. We relate the buffer sharing problem to that of finding independent sets in weighted circular arc graph. An important difference between the ...
متن کامل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, ...
متن کامل