Sciweavers

ICALP
2011
Springer
13 years 2 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
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...
Tim Nonner
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
13 years 8 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
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...
Pinar Heggernes, Daniel Meister, Yngve Villanger
TCS
2010
13 years 9 months ago
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
: 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...
Katerina Asdre, Stavros D. Nikolopoulos
NETWORKS
2010
13 years 9 months ago
Mixed search number and linear-width of interval and split graphs
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.
Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
CORR
2006
Springer
144views Education» more  CORR 2006»
13 years 11 months ago
The minimum linear arrangement problem on proper interval graphs
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 ...
Ilya Safro
ALGORITHMICA
2010
188views more  ALGORITHMICA 2010»
13 years 11 months ago
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs
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 ...
Katerina Asdre, Stavros D. Nikolopoulos
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 11 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
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 ...
Louis Ibarra
FAW
2010
Springer
232views Algorithms» more  FAW 2010»
13 years 12 months ago
Recognizing d-Interval Graphs and d-Track Interval Graphs
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...
Minghui Jiang
IPPS
2003
IEEE
14 years 4 months ago
Channel Assignment on Strongly-Simplicial Graphs
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...
Alan A. Bertossi, Maria Cristina Pinotti, Romeo Ri...
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Canonical Data Structure for Interval Probe Graphs
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...
Ryuhei Uehara