6740 search results - page 338 / 1348 » An s -Hamiltonian Line Graph Problem |
132
click to vote
ALGORITHMICA
2010
15 years 4 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
138
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
116
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
138
click to vote
HPCN
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. Su cient and precise semantic information is essential to interactive parallel programming. In this paper, we present afeasible implementation of the iteration space depe...
151
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...