6740 search results - page 232 / 1348 » An s -Hamiltonian Line Graph Problem |
83
Voted
CORR
2002
Springer
15 years 14 days ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
132
Voted
COCOON
2007
Springer
15 years 6 months 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...
75
Voted
EOR
2007
15 years 18 days 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...
115
Voted
ALGORITHMICA
2004
15 years 16 days 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...
ICASSP
2011
IEEE
14 years 4 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...