dc.contributor.author |
Buzatu, Radu |
|
dc.date.accessioned |
2020-11-02T12:17:57Z |
|
dc.date.available |
2020-11-02T12:17:57Z |
|
dc.date.issued |
2020 |
|
dc.identifier.citation |
BUZATU, Radu. On the Computational Complexity of Optimization Convex Covering Problems of Graphs. In: Computer Science Journal of Moldova.2020, nr.2(83). pp. 187-200. ISSN 1561-4042. |
en |
dc.identifier.issn |
1561-4042 |
|
dc.identifier.uri |
http://dspace.usm.md:8080/xmlui/handle/123456789/3065 |
|
dc.description.abstract |
In this paper we present further studies of convex covers and
convex partitions of graphs. Let G
be a finite simple graph. A
set of vertices
S
of
G
is convex if all vertices lying on a shortest
path between any pair of vertices of
S
are in
S
. If 3
≤ |
S
| ≤
|
X
| −
1, then
S
is a nontrivial set. We prove that determining
the minimum number of convex sets and the minimum number
of nontrivial convex sets, which cover or partition a graph, is in
general NP-hard. We also prove that it is NP-hard to determine
the maximum number of nontrivial convex sets, which cover or
partition a graph. |
en |
dc.language.iso |
en |
en |
dc.publisher |
Institutul de Matematică şi Informatică al AŞM |
en |
dc.subject |
NP-hardness |
en |
dc.subject |
convex cover |
en |
dc.subject |
convex partition |
en |
dc.subject |
graph |
en |
dc.title |
ON THE COMPUTATIONAL COMPLEXITY OF OPTIMIZATION CONVEX COVERING PROBLEMS OF GRAPHS |
en |
dc.type |
Article |
en |