Maximizing Happiness in Graphs of Bounded Clique-Width.
Ivan BliznetsDanil SagunovPublished in: LATIN (2020)
Keyphrases
- independent set
- maximum clique
- graph properties
- graph theoretic
- graph matching
- quasi cliques
- maximum independent set
- random graphs
- graph databases
- graph partitioning
- graph construction
- graph theory
- pattern recognition
- social networks
- information retrieval
- graph mining
- neural network
- weighted graph
- bipartite graph
- bounded treewidth
- labeled graphs
- directed graph
- image segmentation
- bounded degree