Returns minimum cardinality edge dominating set.
G (NetworkX graph) – Undirected graph
min_edge_dominating_set – Returns a set of dominating edges whose size is no more than 2 * OPT.
- Return type
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|)\).