Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.

Andreas Brandstädt Hoàng-Oanh Le Raffaele Mosca

Published in: Int. J. Found. Comput. Sci. (2004)

Keyphrases

independent set
database language
graph theory
neural network
directed graph
maximum clique
maximum weight
graph properties
search algorithm
programming language
random walk
graph structure
graph theoretic