min_maximal_matching

min_maximal_matching(graph)

Returns a set of edges such that no two edges share a common endpoint and every edge not in the set shares some common endpoint in the set.

Parameters :

graph : NetworkX graph

Undirected graph

Returns :

min_maximal_matching : set

Returns a set of edges such that no two edges share a common endpoint and every edge not in the set shares some common endpoint in the set. Cardinality will be 2*OPT in the worst case.

References

[R107]

Vazirani, Vijay Approximation Algorithms (2001)