On Distributed Computation of the Minimum Triangle Edge Transversal
On Distributed Computation of the Minimum Triangle Edge Transversal
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the classic minimum triangle edge transversal problem, and its normalized value is …