Compressed cliques graphs, clique coverings and positive zero forcing.
Shaun M. FallatKaren MeagherAbolghasem SoltaniBoting YangPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- probability distribution
- maximum clique
- maximal cliques
- maximal clique enumeration
- branch and bound algorithm
- association graph
- graph theory
- weighted graph
- independent set
- graph theoretic
- positive and negative
- graph properties
- graph structure
- data structure
- computational biology
- quasi cliques
- pattern recognition
- data compression
- rough sets
- lower bound
- graph mining
- graph matching
- maximum weight