2. Articole

Permanent URI for this collectionhttps://msuir.usm.md/handle/123456789/17

Browse

Filters

2014 - 20152

Settings

Subject: search.filters.subject.convex covers

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    COVERING UNDIRECTED GRAPHS BY CONVEX SETS
    (Valines SRL, 2014) Buzatu, Radu
    This paper is focused on some aspects of undirected graphs covering, in particular convex sets problem (CCS) and partitioning undirected graph into convex sets problem (PCS). We prove theorems regarding existence of graphs with fxed number of convex sets which serve as solutions to CCS and PCS problems.
  • Thumbnail Image
    Item
    CONVEX GRAPH COVERS
    (Academy of Sciences of Moldova, 2015) Buzatu, Radu; Cataranciuc, Sergiu
    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.