-Free Chordal Bipartite Graphs in Polynomial Time.

Andreas Brandstädt

Published in: CoRR (2021)

Keyphrases

bipartite graph
maximum matching
link prediction
special case
minimum weight
maximum cardinality
graph clustering
computational complexity
approximation algorithms
maximum weight
worst case
bipartite graph matching
decision trees
bipartite networks