Browsing by Subject "convexity"

Browsing by Subject "convexity"

Sort by: Order: Results:

  • THE CONVEXITY IN THE COMPLEX OF MULTI-ARY RELATIONS 
    Braguţă, Galina; Cataranciuc, Sergiu (Romanian Society of Applied & Industrial Mathematics Universitatea din Pitesti, 2015)
    For a complex of multi-ary relations [12] it is defined the concept of (k,m)-chain which is a generalization of the concept of chain known from the graph theory. Using (k,m)- chains it is introduced the concept of the ...
  • COVERING UNDIRECTED GRAPHS BY CONVEX SETS 
    Buzatu, Radu (Valines SRL, 2014)
    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 ...
  • MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE 
    Buzatu, Radu (CEP USM, 2017)
    The nontrivial convex p-cover problem of a tree is studied.We propose the recursive formula that determines the maximum nontrivial convex cover number of a tree.
  • ON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS 
    Buzatu, Radu; Cataranciuc, Sergiu (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018)
    In this paper we prove that it is NP-complete to decide whet- her a graph can be partitioned into nontrivial convex sets. We show that it can be verified in polynomial time whether a graph can be covered by nontrivial ...