ALGORITHMICA

2010

13 years 8 months ago
2010

ALGORITHMICA

2010

13 years 9 months ago
2010

ALGORITHMICA

2010

13 years 9 months ago
2010

The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...

ALGORITHMICA

2010

13 years 10 months ago
2010

We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...

ALGORITHMICA

2010

13 years 10 months ago
2010

ALGORITHMICA

2010

13 years 10 months ago
2010

ALGORITHMICA

2010

13 years 11 months 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

13 years 11 months ago
2010

When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...

ALGORITHMICA

2010

13 years 11 months ago
2010

We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba