6740 search results - page 380 / 1348 » An s -Hamiltonian Line Graph Problem |
139
click to vote
CCCG
2001
15 years 6 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
122
click to vote
SIAMDM
1998
15 years 4 months ago
1998
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
126
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
116
click to vote
ICDT
2007
ACM
15 years 10 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...