Login / Signup
A convexity upper bound for the number of maximal bicliques of a bipartite graph.
Alexandre Albano
Alair Pereira do Lago
Published in:
Discret. Appl. Math. (2014)
Keyphrases
</>
bipartite graph
upper bound
computational complexity
learning algorithm
edge weights
maximum matching