HGraph.Undirected.Solvers.IndependentSet
maximize :: (Adjacency t, Mutable t) => t a -> [a] Source #
Find a maximum independet set in g
g
atLeast :: (Adjacency t, Mutable t) => t a -> Int -> Maybe [a] Source #
Search for an independent set of size at least k in g
k
reduce :: (Adjacency t, Mutable t) => t a -> Int -> (t a, [a], Int) Source #