104 search results - page 11 / 21 » On the Complexity of Some Colorful Problems Parameterized by... |
RECOMB
2007
Springer
14 years 7 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...
MFCS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
JGT
2007
13 years 7 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...