MICS

2010

13 years 2 months ago
2010

In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...

IWOCA

2010

Springer

13 years 2 months ago
2010

Springer

A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...

ISAAC

2010

Springer

13 years 6 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 6 months ago
2010

: We study a variant of the path cover problem, namely, the k-ﬁxed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-ﬁxe...

TAMC

2010

Springer

13 years 6 months ago
2010

Springer

Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...

CORR

2006

Springer

13 years 8 months 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 ...

APPML

2008

13 years 8 months ago
2008

In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimiz...