2294 search results - page 261 / 459 » From Path Graphs to Directed Path Graphs |
156
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
110
click to vote
AAAI
1996
15 years 4 months ago
1996
If a state space is not completely known in advance, then search algorithms have to explore it sufficiently to locate a goal state and a path leading to it, performing therefore w...
110
click to vote
DIS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
111
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
111
click to vote
TIP
2008
15 years 3 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...