Maximal independent sets in bipartite graphs obtained from Boolean lattices.

Dwight Duffus Peter Frankl Vojtech Rödl

Published in: Eur. J. Comb. (2011)

Keyphrases

bipartite graph
bipartite graph matching
maximum matching
dynamic programming
keywords
optimal solution
graph clustering
closed sets
maximum weight
maximum cardinality