Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects.

Eldar Fischer Eyal Rozenberg

Published in: APPROX-RANDOM (2007)

Keyphrases

bipartite graph
lower bound
upper bound
maximum matching
graph model
d objects
bipartite graph matching
link prediction
pairwise
minimum weight
maximum cardinality
objective function
maximum weight
graph clustering
branch and bound
test cases
optimal solution