Login / Signup
Complexity of Minimum Biclique Cover and Minimum Biclique Decomposition for Bipartite Domino-free Graphs.
Jérôme Amilhastre
Marie-Catherine Vilarem
Philippe Janssen
Published in:
Discret. Appl. Math. (1998)
Keyphrases
</>
graph theoretic
information retrieval
special case
graph partitioning
data sets
graphical models
graph model
space complexity
neural network
objective function
search algorithm
structured data
decision problems
graph theory
minimum cost