NetworkX

Previous topic

clique_removal

Next topic

min_edge_dominating_set

min_weighted_dominating_set

min_weighted_dominating_set(graph, weight=None)[source]

Return minimum weight dominating set.

Parameters :

graph : NetworkX graph

Undirected graph

weight : None or string, optional (default = None)

If None, every edge has weight/distance/weight 1. If a string, use this edge attribute as the edge weight. Any edge attribute not present defaults to 1.

Returns :

min_weight_dominating_set : set

Returns a set of vertices whose weight sum is no more than 1 + log w(V)

References

[R105]Vazirani, Vijay Approximation Algorithms (2001)