253 search results - page 33 / 51 » Edge and Node Searching Problems on Trees |
133
click to vote
IFL
1997
Springer
15 years 8 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
124
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
149
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
In this paper we describe a problem of discovering query clusters from a click-through graph of web search logs. The graph consists of a set of web search queries, a set of pages ...
123
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—We study the problem of data-driven routing and navigation in a distributed sensor network over a continuous scalar field. Specifically, we address the problem of searching fo...
168
Voted
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...