ICALP
2011
Springer
13 years 4 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
ISAAC
2010
Springer
13 years 10 months ago
2010
Springer
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
TCS
2010
13 years 11 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
NETWORKS
2010
13 years 11 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
CORR
2006
Springer
14 years 15 days ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
ALGORITHMICA
2010
14 years 19 days ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
ALGORITHMICA
2010
14 years 19 days ago
2010
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
FAW
2010
Springer
14 years 1 months ago
2010
Springer
A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval...
IPPS
2003
IEEE
14 years 5 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
ISAAC
2004
Springer
14 years 5 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...