|
|
|
|
|
Wenjun Li, Xueying Yang, Chao Xu and Yongjie Yang
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions...
ver más
|
|
|
|
|