668 search results - page 29 / 134 » Algorithmics and Applications of Tree and Graph Searching |
149
click to vote
SDM
2012
SIAM
13 years 4 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
115
click to vote
COMAD
2009
15 years 3 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
125
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
112
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
113
click to vote
ICTAI
2003
IEEE
15 years 7 months ago
2003
IEEE
Conflict analysis is a powerful paradigm of backtrack search algorithms, in particular for solving satisfiability problems arising from practical applications. Accordingly, most...