1402 search results - page 158 / 281 » Sparse-Memory Graph Search |
121
Voted
TCS
2008
15 years 2 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
103
click to vote
CN
2000
15 years 2 months ago
2000
The study of the web as a graph is not only fascinating in its own right, but also yields valuable insight into web algorithms for crawling, searching and community discovery, and...
126
click to vote
ICCS
2000
Springer
15 years 6 months ago
2000
Springer
With the aim of building a "Semantic Web", the content of the documents must be explicitly represented through metadata in order to enable contents-guided search. Our app...
119
Voted
4OR
2004
15 years 2 months ago
2004
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
122
Voted
ALGORITHMICA
2002
15 years 2 months ago
2002
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...