Cited By
View all- Geissmann BGianinazzi L(2021)Parallel Minimum Cuts in Near-linear Work and Low DepthACM Transactions on Parallel Computing10.1145/34608908:2(1-20)Online publication date: 23-Aug-2021
In the feedback vertex set problem, the aim is to minimize, in a connected graph G = (V, E), the cardinality of the set V(G) ⊆ V, whose removal induces an acyclic subgraph. In this paper, we show an interesting relationship between the minimum feedback ...
For a graph , a subset D of vertex set V, is a dominating set of G if every vertex not in D is adjacent to atleast one vertex of D. A dominating set D of a graph G with no isolated vertices is called a paired dominating set (PD-set), if G[D]...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in