1963 search results - page 36 / 393 » The Maximum Solution Problem on Graphs |
116
click to vote
WG
2009
Springer
15 years 9 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
171
Voted
GECCO
2009
Springer
15 years 1 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
138
click to vote
CPM
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
131
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
134
click to vote
MIAR
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...