668 search results - page 9 / 134 » Algorithmics and Applications of Tree and Graph Searching |
157
click to vote
IFL
1997
Springer
15 years 10 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...
153
Voted
EVOW
2007
Springer
15 years 12 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
173
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
194
click to vote
COCOA
2009
Springer
16 years 12 days ago
2009
Springer
Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...
165
Voted
NECO
2002
15 years 5 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...