137
Voted
COCOA
15 years 10 months ago
2007 Springer  119
Voted
COCOA
15 years 10 months ago
2007 Springer 
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver
137
click to vote
COCOA
15 years 10 months ago
2007 Springer 
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
141
Voted
COCOA
15 years 10 months ago
2007 Springer 
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
|
Discrete Geometry