Login / Signup
Clique-width of graphs defined by one-vertex extensions.
Michaël Rao
Published in:
Discret. Math. (2008)
Keyphrases
</>
directed graph
attributed graphs
independent set
undirected graph
labeled graphs
graph kernels
graph structure
strongly connected
maximum clique
graph properties
graph matching
maximum independent set
data sets
hamiltonian cycle
graph theory
efficient implementation
special case