Graphs of Power-Bounded Clique-Width.
Flavia BonomoLuciano N. GrippoMartin MilanicMartín Darío SafePublished in: CoRR (2014)
Keyphrases
- maximum clique
- independent set
- quasi cliques
- graph matching
- power consumption
- graph properties
- graph theoretic
- maximum independent set
- graph model
- graph representation
- random graphs
- graph kernels
- bounded treewidth
- graph partitioning
- graph mining
- fully connected
- subgraph isomorphism
- weighted graph
- branch and bound algorithm
- directed graph
- neural network