Finding the minimum bandwidth of an interval graph
نویسندگان
چکیده
منابع مشابه
On Finding the Minimum Bandwidth of Interval Graphs
Let G = (V, E) be an interval graph, with 1 VI = n, and IE] = m. An O(n’ log n) algorithm was proposed in Kratsch (Inform Compui. 74, 14O158 (1987)) to find the bandwidth of G. We show that this algorithm is wrong, and provide a corrected version of the same. Also, it was observed in [4] that the bandwidth of a proper inferual graph can be computed in O(n log n + m) time. We show how this idea ...
متن کاملInterval degree and bandwidth of a graph
The interval degree id(G) of a graph G is de/ned to be the smallest max-degree of any interval supergraphs of G. One of the reasons for our interest in this parameter is that the bandwidth of a graph is always between id(G)=2 and id(G). We prove also that for any graph G the interval degree of G is at least the pathwidth of G. We show that if G is an AT-free claw-free graph, then the interval d...
متن کاملMinimum 2-Tuple Dominating Set of an Interval Graph
The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...
متن کاملAn Algorithm to find a Minimum Feedback Vertex Set of an Interval Graph
In an undirected graph, the feedback vertex set problem is to find a set of vertices of minimum cardinality whose removal makes the graph acyclic (connected or disconnected). This problem is known to be NP-hard for general graph. In this paper, we proposed two algorithms for finding the minimum feedback vertex set on interval graphs. The first algorithm is for unweighted case and takes O(n + m)...
متن کاملFinding a minimum independent dominating set in a permutation graph
We give an 0 (nlogln) [ime algorirnm for finding a minimum independem dominating se[ in a pennmation graph. TItis improves on ilie previous D(n 3) time algorictun known for solving tllis problem [4]. .,. Dept of CompUlcr Sci., Purdue Univ., West Gf:tyelle, IN 47907. Rcso::trch ~upported by ONR. Contr:lct NOOOI-l-34-K. 0502:md NSF Gl':tnl DCR-8451393, wilh matching funds from AT&T. • o.:pt of Ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1987
ISSN: 0890-5401
DOI: 10.1016/0890-5401(87)90028-9