Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width

Tomer Kotek, Johann A. Makowsky. Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. In Mohammad Taghi Hajiaghayi, Mohammad Reza Mousavi, editors, Topics in Theoretical Computer Science - The First IFIP WG 1.8 International Conference, TTCS 2015, Tehran, Iran, August 26-28, 2015, Revised Selected Papers. Volume 9541 of Lecture Notes in Computer Science, pages 135-146, Springer, 2015. [doi]

Authors

Tomer Kotek

This author has not been identified. Look up 'Tomer Kotek' in Google

Johann A. Makowsky

This author has not been identified. Look up 'Johann A. Makowsky' in Google