1402 search results - page 64 / 281 » Sparse-Memory Graph Search |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
This paper gives an algorithm for finding the minimum weight tree having k edges in an edge weighted graph. The algorithm combines a search and optimization technique based on phe...
GBRPR
2009
Springer
15 years 2 months ago
2009
Springer
This paper proposes to transform data scanned randomly in a well-defined space (e.g, Euclidean) along a hierarchical irregular pyramidal structure in an attempt reduce search time...
SBP
2011
Springer
14 years 4 months ago
2011
Springer
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
OOPSLA
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...