860 search results - page 164 / 172 » Biased Random Walks |
MST
2006
13 years 9 months ago
2006
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
IM
2007
13 years 9 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
TMC
2008
13 years 9 months ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...
COR
2000
13 years 9 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
PVLDB
2008
13 years 9 months ago
2008
The amount of biological data publicly available has experienced an exponential growth as the technology advances. Online databases are now playing an important role as informatio...