6740 search results - page 496 / 1348 » An s -Hamiltonian Line Graph Problem |
151
click to vote
IPL
2002
15 years 6 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
194
click to vote
JGT
2011
15 years 1 months ago
2011
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
189
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
162
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
196
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...