4137 search results - page 76 / 828 » On the number of matchings of a tree |
131
click to vote
PVLDB
2010
15 years 10 days ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
110
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
112
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
WABI
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
WABI
2004
Springer
15 years 7 months ago
2004
Springer
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the...