Login / Signup
A characterization of diameter-2-critical graphs whose complements are diamond-free.
Teresa W. Haynes
Michael A. Henning
Published in:
Discret. Appl. Math. (2012)
Keyphrases
</>
graph matching
data mining
graph databases
data sets
feature selection
object recognition
optical flow
network structure
directed graph
graph mining
spanning tree
maximal cliques