201 search results - page 12 / 41 » The Minimum Substring Cover Problem |
KAIS
2006
15 years 2 months ago
2006
This paper defines a challenging problem of pattern matching between a pattern P and a text T, with wildcards and length constraints, and designs an efficient algorithm to return e...
114
click to vote
TCS
2008
15 years 2 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
118
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
121
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
106
click to vote
TIT
2008
15 years 2 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...