Return minimum cardinality edge dominating set.
Parameters: | G : NetworkX graph
|
---|---|
Returns: | min_edge_dominating_set : set
|
Notes
The algorithm computes an approximate solution to the edge dominating set problem. The result is no more than 2 * OPT in terms of size of the set. Runtime of the algorithm is \(O(|E|)\).