Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
539 7 |
Ultima descărcare din IBN: 2023-12-05 10:19 |
Căutarea după subiecte similare conform CZU |
519.6+519.854+519.17 (1) |
Matematică computațională. Analiză numerică. Programarea calculatoarelor (123) |
Cercetări operaționale (OR) teorii şi metode matematice (169) |
Analiză combinatorică. Teoria grafurilor (115) |
SM ISO690:2012 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. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | |||||||
Numărul 2(83) / 2020 / ISSN 1561-4042 /ISSNe 2587-4330 | |||||||
|
|||||||
CZU: 519.6+519.854+519.17 | |||||||
MSC 2010: 05A18, 05C35, 68Q25, 68R10 | |||||||
Pag. 187-200 | |||||||
|
|||||||
Descarcă PDF | |||||||
Rezumat | |||||||
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. |
|||||||
Cuvinte-cheie NP-hardness, convex cover, convex partition, graph |
|||||||
|