6740 search results - page 367 / 1348 » An s -Hamiltonian Line Graph Problem |
167
click to vote
SAC
2011
ACM
14 years 7 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
145
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
159
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
146
click to vote
ICAC
2006
IEEE
15 years 10 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
128
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...