906 search results - page 56 / 182 » Matching Subsequences in Trees |
103
Voted
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
134
Voted
PR
2008
15 years 2 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
102
Voted
MFCS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
110
Voted
IFSA
2007
Springer
15 years 9 months ago
2007
Springer
Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the In...
148
click to vote
IEEESCC
2009
IEEE
15 years 14 days ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...