Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width.
Tomer KotekJohann A. MakowskyPublished in: TTCS (2015)
Keyphrases
- efficient computation
- independent set
- computational efficiency
- maximum clique
- graph properties
- quasi cliques
- aggregate queries
- fixed width
- graph theoretic
- markov random field
- window search
- maximum weight
- graph databases
- weighted graph
- graph theory
- skyline queries
- maximal cliques
- bipartite graph
- computational complexity
- database systems
- search engine