3 search results - page 1 / 1 » An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on ... |
MICS
2010
12 years 11 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
TCS
2010
13 years 2 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...