The dominating sets module

Dominating sets class.

class hcga.features.dominating_sets.DominatingSets(graph=None)

Dominating sets class.

Features based on dominating sets. Where dominating set for a graph with node set V is a subset D of V such that every node not in D is adjacent to at least one member of D 1.

Uses networkx: Networkx_dominating_set

References

1

https://en.wikipedia.org/wiki/Dominating_set

2

Abdol-Hossein Esfahanian. Connectivity Algorithms. http://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf

Initialise a feature class.

Parameters

graph (Graph) – graph for initialisation, converted to given encoding

compute_features()

Main feature extraction function.

This function should be used by each specific feature class to add new features.

hcga.features.dominating_sets.maximal_matching(G)

Taken from networkx.

hcga.features.dominating_sets.min_edge_dominating_set(G)

Taken from networkx.

hcga.features.dominating_sets.min_weighted_dominating_set(G, weight=None)

Taken from netoworkx.

hcga.features.dominating_sets.size_dominating_set(graph)

hcga.features.dominating_sets.size_min_dominating_set(graph)

hcga.features.dominating_sets.size_min_edge_dominating_set(graph)