Sciweavers

1302 search results - page 122 / 261
» On the Strong Chromatic Number
Sort
View
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 10 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
15 years 8 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
BMCBI
2010
110views more  BMCBI 2010»
15 years 6 months ago
Missing value imputation for epistatic MAPs
Background: Epistatic miniarray profiling (E-MAPs) is a high-throughput approach capable of quantifying aggravating or alleviating genetic interactions between gene pairs. The dat...
Colm Ryan, Derek Greene, Gerard Cagney, Padraig Cu...
BMCBI
2010
135views more  BMCBI 2010»
15 years 6 months ago
Simple and flexible classification of gene expression microarrays via Swirls and Ripples
Background: A simple classification rule with few genes and parameters is desirable when applying a classification rule to new data. One popular simple classification rule, diagon...
Stuart G. Baker
TCS
2008
15 years 6 months ago
Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
From an engineering point of view, the problem of coordinating a set of autonomous, mobile robots for the purpose of cooperatively performing a task has been studied extensively o...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro...