195 search results - page 6 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. We prove in this paper that the PATHWIDTH problem is NP-hard for parti...
AI
2007
Springer
13 years 7 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...