CONVEX GRAPH COVERS
| dc.contributor.author | Buzatu, Radu | |
| dc.contributor.author | Cataranciuc, Sergiu | |
| dc.date.accessioned | 2016-04-21T11:43:02Z | |
| dc.date.available | 2016-04-21T11:43:02Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | We study some properties of minimum convex covers and minimum convex partitions of simple graphs. We establish existence of graphs with fixed number of minimum convex covers and minimum convex partitions. It is known that convex p-cover problem is NP-complete for p\geq3 [5]. We prove that this problem is NP-complete in the case p=2. Also, we study covers and partitions of graphs when respective sets are nontrivial convex. | en |
| dc.identifier.citation | BUZATU, R., CATARANCIUC, S. Convex graph covers. In: Computer Science Journal of Moldova. 2015, Vol.23, n.3(69), pp.251-269 | en |
| dc.identifier.issn | 1561-4042 | |
| dc.identifier.uri | https://doaj.org/toc/1561-4042 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/621 | |
| dc.language.iso | en | en |
| dc.publisher | Academy of Sciences of Moldova | en |
| dc.subject | Convexity | en |
| dc.subject | graphs | en |
| dc.subject | convex covers | en |
| dc.subject | convex partitions | en |
| dc.title | CONVEX GRAPH COVERS | en |
| dc.type | Article | en |