Browsing by Author "Buzatu, Radu"
Now showing 1 - 15 of 15
- Results Per Page
- Sort Options
Item ACOPERIREA CU MULȚIMI d-CONVEXE A GRAFURILOR NEORIENTATE(2017) Buzatu, Radu; Cataranciuc, SergiuScopul și obiectivele lucrării. Scopul urmărit prin realizarea tezei constă în studierea și soluționarea problemei de acoperire a unui graf neorientat cu mulțimi d-convexe. Pentru atingerea scopului sunt fixate următoarele obiective: examinarea complexității problemei de acoperire a grafului cu un număr p>2 de mulțimi d-convexe; stabilirea condițiilor de existență a unei familii de mulțimi d-convexe, ce formează o acoperire a grafului neorientat; soluționarea problemei de acoperire a grafului cu mulțimi d-convexe netriviale; elaborarea algoritmilor pentru problema de acoperire/divizare a grafului cu mulțimi d-convexe; estimarea numărului de acoperire d-convexă minimă/maximă.Item CALCULUL PROPOZIȚIILOR ȘI LOGICA PREDICATELOR: NOTE DE CURS(CEP USM, 2021) Buzatu, Radu; Novac, Ludmila; Cucu, IonLucrarea este direcționată spre formarea competențelor specifice disciplinei Logica Matematică și Teoria Mulțimilor la studenții de la specialitățile de Informatică, Informatică Aplicată și Tehnologii Informaționale de la facultățile: Matematică și Informatică; Fizica și Inginerie.Item CONVEX GRAPH COVERS(Academy of Sciences of Moldova, 2015) Buzatu, Radu; Cataranciuc, SergiuWe 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.Item COVERING GRAPHS BY CONVEX SETS: MONOGRAPH(CEP USM, 2021) Buzatu, RaduThis monograph is intended to present the main results obtained by the author related to the convex covering and partitioning of graphs. It has been designed to be useful for research workers in the field, graduate students, and advanced undergraduates.Item COVERING UNDIRECTED GRAPHS BY CONVEX SETS(Valines SRL, 2014) Buzatu, RaduThis 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.Item MAXIMUM NONTRIVIAL CONVEX COVER NUMBER OF JOIN AND CORONA OF GRAPHS(Institutul de Matematică şi Informatică al AŞM, 2021) Buzatu, RaduLet G be a connected graph. We say that a set S ⊆ X(G) is convex in G if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. The greatest p ≥ 2 for which there is a cover of G by p nontrivial and convex sets is the maximum nontrivial convex cover number of G. In this paper, we determine the maximum nontrivial convex cover number of join and corona of graphsItem MAXIMUM NONTRIVIAL CONVEX COVER NUMBER OF JOIN AND CORONA OF GRAPHS(2021) Buzatu, RaduLet G be a connected graph. We say that a set S ⊆ X(G) is convex in G if, for any two vertices x, y ∈ S, all vertices of every shortest path between x and y are in S. If 3 ≤ |S| ≤ |X(G)| − 1, then S is a nontrivial set. The greatest p ≥ 2 for which there is a cover of G by p nontrivial and convex sets is the maximum nontrivial convex cover number of G. In this paper, we determine the maximum nontrivial convex cover number of join and corona of graphs.Item MAXIMUM NONTRIVIAL CONVEX COVER OF A TREE(CEP USM, 2017) Buzatu, RaduThe 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.Item MILP Model for Scheduling Jobs and Crews with Employee Workload Balancing and Job Lateness [Articol](2024) Buzatu, RaduThis study aims to propose an original and flexible mixed integer linear programming (MILP) model for scheduling jobs and crews. The proposed model minimizes the costs of assigning jobs to crews, employee workload heterogeneity and job lateness.Item MINIMUM CONVEX COVER OF SPECIAL NON ORIENTED GRAPHS(CEP USM, 2016) Buzatu, RaduA vertex set S of a graph G is convex if all vertices of every shortest path between two of its vertices are in S. We say that G has a convex p-cover if X (G)can be overed by p convex sets. The convex cover number of G Is the least p 2 for which G has a convex p-cover.In particular, the nontrivial convex cover number of G is the least p 2 for which G has a convex p-cover, where every set contains at least 3 elements. In this paper we determine convex cover number and nontrivial convex cover number of special graphs resulting from some operations. We examine graphs resulting from join of graphs, Cartesian product of graphs, lexicographic product of graphs and corona of graphs.Item ON NONTRIVIAL COVERS AND PARTITIONS OF GRAPHS BY CONVEX SETS(Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018) Buzatu, Radu; Cataranciuc, SergiuIn 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 convex sets. Also, we propose a re- cursive formula that establishes the maximum nontrivial convex cover number of a tree.Item ON THE COMPUTATIONAL COMPLEXITY OF OPTIMIZATION CONVEX COVERING PROBLEMS OF GRAPHS(Institutul de Matematică şi Informatică al AŞM, 2020) Buzatu, RaduIn 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.Item TEHNOLOGII INFORMAŢIONALE DE COMUNICARE: ÎNDRUMAR PENTRU LUCRĂRI DE LABORATOR(CEP USM, 2020) Calmîş, Elena; Braguţa, Galina; Buzatu, Radu; Leonte, Stanislav; Ţurcanu, CălinSetul de lucrări de laborator acoperă integral competenţele şi obiectivele generale prevăzute în curriculumul disciplinei TIC, elaborat în cadrul Departamentului Matematică, Facultatea de Matematică şi Informatică (USM) şi destinată studenţilor anului I, Ciclul I Licenţă, ai facultăţilor de Drept, Istorie şi Filosofie, Psihologie şi Ştiinţe ale Educaţiei, Litere, precum şi tuturor celor care doresc să se iniţieze în utilizarea TIC.Item TEORIA GRAFURILOR: NOTE DE CURS(CEP USM, 2022) Buzatu, RaduNotele de curs au ca scop familiarizarea studenților cu fundamentele teoretice ale teoriei grafurilor și sunt destinate spre formarea competențelor specifice disciplinelor Teoria grafurilor și Algoritmica grafurilor la studenții de la specialitățile de Matematică, Matematici aplicate, Informatică și Informatica Aplicată de la Facultatea de Matematică şi Informatică.Item UN MODEL MATEMATIC PENTRU OPTIMIZAREA ORGANIZĂRII ADMINISTRATIV - TERITORIALE A REPUBLICII MOLDOVA(CEP USM, 2018) Buzatu, Radu; Rabei, Cristina; Roșcovan, MihaiÎn lucrare se propune un model matematic de programare liniară în numere întregi pentru optimizarea organizării administrativ-teritoriale a Republicii Moldova care poate servi ca un instrument obiectiv și flexibil pentru obținerea și evaluarea scenariilor potenţiale de consolidare administrativ-teritorială.