Login / Signup
Efficient computation of generalized Ising polynomials on graphs with fixed clique-width.
Tomer Kotek
Johann A. Makowsky
Published in:
CoRR (2015)
Keyphrases
</>
efficient computation
maximum clique
computational efficiency
independent set
aggregate queries
graph properties
quasi cliques
graph theory
graph theoretic
markov random field
fixed width
search engine
principal component analysis
maximum weight
window search