668 search results - page 44 / 134 » Algorithmics and Applications of Tree and Graph Searching |
134
click to vote
ALMOB
2006
15 years 2 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
112
click to vote
ESA
1998
Springer
15 years 6 months ago
1998
Springer
We present a new approach for designing external graph algorithms and use it to design simple, deterministic and randomized external algorithms for computing connected components, ...
115
click to vote
AI
2010
Springer
15 years 2 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
133
click to vote
SODA
2007
ACM
15 years 3 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
117
click to vote
AI
2003
Springer
15 years 7 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...