6740 search results - page 362 / 1348 » An s -Hamiltonian Line Graph Problem |
135
click to vote
CCCG
2007
15 years 6 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
138
click to vote
IPCO
2010
15 years 6 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
150
click to vote
IPL
1998
15 years 4 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
136
click to vote
HYBRID
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we address the problem of designing energy minimizing collision-free maneuvers for multiple agents moving on a plane. We show that the problem is equivalent to that o...
181
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...