An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals.

Steffen Rechner

Published in: CoRR (2017)

Keyphrases

dynamic programming
optimal solution
worst case
learning algorithm
bipartite graph
k means
objective function
computational complexity
matching algorithm
spanning tree
maximum matching
clustering method
minimum spanning tree
graph clustering
greedy heuristic