6740 search results - page 429 / 1348 » An s -Hamiltonian Line Graph Problem |
167
click to vote
WDAG
2007
Springer
16 years 27 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
193
click to vote
PVLDB
2010
15 years 5 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
201
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division mult...
178
click to vote
STACS
2005
Springer
16 years 7 days ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
209
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...