Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

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

Tomer Kotek
  • Function : Author
  • PersonId : 999367

Abstract

Graph polynomials which are definable in Monadic Second Order Logic ($\mathrm {MSOL}$) on the vocabulary of graphs are Fixed-Parameter Tractable ($\mathrm {FPT}$) with respect to clique-width. In contrast, graph polynomials which are definable in $\mathrm {MSOL}$ on the vocabulary of hypergraphs are fixed-parameter tractable with respect to tree-width, but not necessarily with respect to clique-width. No algorithmic meta-theorem is known for the computation of graph polynomials definable in $\mathrm {MSOL}$ on the vocabulary of hypergraphs with respect to clique-width. We define an infinite class of such graph polynomials extending the class of graph polynomials definable in $\mathrm {MSOL}$ on the vocabulary of graphs and prove that they are Fixed-Parameter Polynomial Time ($\mathrm {FPPT}$ or $\mathrm {XP}$) computable, i.e. that they can be computed in time $O(n^{f(k)})$, where n is the number of vertices and k is the clique-width.
Fichier principal
Vignette du fichier
385217_1_En_10_Chapter.pdf (362.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01446257 , version 1 (25-01-2017)

Licence

Attribution

Identifiers

Cite

Tomer Kotek, Johann A. Makowsky. Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width. 1st International Conference on Theoretical Computer Science (TTCS), Aug 2015, Tehran, Iran. pp.135-146, ⟨10.1007/978-3-319-28678-5_10⟩. ⟨hal-01446257⟩
32 View
46 Download

Altmetric

Share

Gmail Facebook X LinkedIn More