5889 search results - page 194 / 1178 » Graph Layout Problems |
197
click to vote
COCOON
2007
Springer
16 years 17 days ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
126
click to vote
EOR
2007
15 years 6 months ago
2007
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
185
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
155
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
187
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...