Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.

Henning Fernau Serge Gaspers Dieter Kratsch Mathieu Liedloff Daniel Raible

Published in: CTW (2009)

Keyphrases

graph theory
computationally efficient
significant improvement
maximal cliques
learning algorithm
computational complexity
data structure
brute force
computational cost
optimization problems
theoretical analysis
combinatorial optimization
depth first search
exact and approximate
maximum flow
maximum clique