Sciweavers

ALGORITHMICA
2010
84views more  ALGORITHMICA 2010»
13 years 9 months ago
Minimum Degree Orderings
Hiroshi Nagamochi
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 9 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
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...
Chính T. Hoàng, Marcin Kaminski, Vad...
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
13 years 11 months ago
Multi-Color Pebble Motion on Graphs
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...
Gilad Goraly, Refael Hassin
ALGORITHMICA
2010
75views more  ALGORITHMICA 2010»
13 years 11 months ago
Scheduling Jobs on Grid Processors
Joan Boyar, Lene M. Favrholdt
ALGORITHMICA
2010
86views more  ALGORITHMICA 2010»
13 years 11 months ago
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
L. Sunil Chandran, Mathew C. Francis, Naveen Sivad...
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
106views more  ALGORITHMICA 2010»
13 years 11 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
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...
James Allen Fill, Takéhiko Nakama
ALGORITHMICA
2010
122views more  ALGORITHMICA 2010»
13 years 11 months ago
Faster Algorithms for Stable Allocation Problems
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
Brian C. Dean, Siddharth Munshi