Login / Signup
Computing a Minimum Biclique Cover is Polynomial for Bipartite Domino-Free Graphs.
Jérôme Amilhastre
Philippe Janssen
Marie-Catherine Vilarem
Published in:
SODA (1997)
Keyphrases
</>
graph theoretic
bipartite graph
graph model
undirected graph
graph partitioning
graph matching
graph representation
spanning tree
square error
pattern recognition
vertex set
connected dominating set
data sets
graph clustering
graph theory
ranking algorithm
graphical models
clustering algorithm
neural network