10608 search results - page 86 / 2122 » Complexity of O'Hara's Algorithm |
AAIM
2005
Springer
14 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
WABI
2005
Springer
14 years 3 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
ISAAC
2001
Springer
14 years 2 months ago
2001
Springer
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
COCOON
2008
Springer
13 years 11 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
CPHYSICS
2011
13 years 1 months ago
2011
The inner silicon detector of the Compact Muon Solenoid experiment (CMS) at CERN’s LHC consists of 16 588 modules. Charged-particle tracks in the detector are used to improve th...