1545 search results - page 125 / 309 » On tree congestion of graphs |
COLING
2010
14 years 5 months ago
2010
We propose to analyse semantic similarity in comparable text by matching syntactic trees and labeling the alignments according to one of five semantic similarity relations. We pre...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
111
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
BMCBI
2006
14 years 10 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...