Join Our Newsletter

ICALP

2011

Springer

9 years 6 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...

CORR

2011

Springer

9 years 6 months ago
2011

Springer

Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...

JGT

2010

10 years 1 months ago
2010

Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...

DM

2007

10 years 2 months ago
2007

In this note, a constructive proof is given that the classes of proper interval graphs and unit interval graphs coincide, a result originally established by Fred S. Roberts. Addit...

COR

2007

10 years 2 months ago
2007

The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...

CORR

2008

Springer

10 years 2 months ago
2008

Springer

An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...

ICALP

1995

Springer

10 years 6 months ago
1995

Springer

The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...

ESA

2000

Springer

10 years 6 months ago
2000

Springer

The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...

ESA

2009

Springer

10 years 7 months ago
2009

Springer

The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...

ESA

2005

Springer

10 years 8 months ago
2005

Springer

We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...