195 search results - page 1 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
CPM
2004
Springer
14 years 1 months ago
2004
Springer
For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) i...
FCT
2001
Springer
14 years 4 days ago
2001
Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
NETWORKS
1998
13 years 7 months ago
1998
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Given an n-node graph and a subset of k terminal nodes, the NP-hard Steiner tree problem is to compute a minimum-size tree which spans the terminals. All the known algorithms for t...