On the Computational Complexity of Optimization Convex Covering Problems of Graphs
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\leq|S|\leq|X|-1$, then $S$ is a nontrivia...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2020-09-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v28-n2/v28-n2-(pp187-200).pdf |