Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size.

Felix Lazebnik Vasiliy A. Ustimenko

Published in: Discret. Appl. Math. (1995)

Keyphrases

maximal cliques
computational complexity
construction process
maximum clique
data sets
database
neural network
search engine
pattern recognition
object recognition
graph structure
space complexity
small size
arbitrary size