On Graphs Whose Graphoidal Length Is Half of Its Size.

Purnima Gupta Rajesh Singh

Published in: ICTCSDM (2016)

Keyphrases

maximum number
maximal cliques
total length
graph theoretic
small size
memory requirements
real time
data sets
neural network
case study
computational complexity
directed graph
graph matching
standard deviation
graph mining
complex structures