Parallelizing an algorithm to decide if a bipartite graph is shellable.

Andres Galvis Roberto Cruz John Willian Branch Christian Trefftz

Published in: EIT (2013)

Keyphrases

bipartite graph
maximum cardinality
dynamic programming
matching algorithm
search space
objective function
worst case
data sets
social networks
optimal solution
clustering method
graph model
bipartite graph matching