942 search results - page 82 / 189 » Constraints in Graph Drawing Algorithms |
116
click to vote
IPMU
2010
Springer
15 years 4 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
113
Voted
JAIR
2000
15 years 2 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
131
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
15 years 2 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
151
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
122
Voted
VL
1992
IEEE
15 years 6 months ago
1992
IEEE
Automatic graphic objectlayout methods havelong been studied in many application areas in which graphic objects should be laid out to satisfy the constraints specific to each appl...