668 search results - page 26 / 134 » Algorithmics and Applications of Tree and Graph Searching |
131
click to vote
IWOCA
2010
Springer
14 years 8 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
134
click to vote
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we study the problem of an optimal assignment of a tree-structured context reasoning procedure onto the computation resources in a hostsatellites configuration. The...
108
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
129
click to vote
PPOPP
2012
ACM
13 years 9 months ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
142
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...