论文信息 - Approximating independence polynomials of claw-free graphs Sukhada

Approximating independence polynomials of claw-free graphs Sukhada

Matchings in graphs correspond to independent sets in the corresponding line graphs. Line graphs are an important subclass of claw-free graphs. Hence studying independence polynomials of claw-free graphs is a natural extension of studying matching polynomials of graphs. We extend a result of Bayati et.al. showing a fully polynomial time approximation scheme (FPTAS) for computing the independence polynomial of claw-free graphs. In [1] an FPTAS was shown to exist for computing matching polynomials for all graphs and the independence polynomials of a special subset of claw-free graphs called simplicial claw-free graphs.

Fadnavis

[1] Paul D. Seymour,et al. Claw-free graphs. II. Non-orientable prismatic graphs , 2008, J. Comb. Theory, Ser. B.

[2] Paul D. Seymour,et al. Claw-free graphs. III. Circular interval graphs , 2008, J. Comb. Theory, Ser. B.

[3] David Gamarnik,et al. Simple deterministic approximation algorithms for counting matchings , 2007, STOC '07.

[4] James Matthews,et al. Markov chains for sampling matchings , 2008 .

[5] Paul D. Seymour,et al. Claw-free graphs. IV. Decomposition theorem , 2008, J. Comb. Theory, Ser. B.

[6] Paul D. Seymour,et al. Claw-free graphs. V. Global structure , 2008, J. Comb. Theory, Ser. B.

[7] Paul D. Seymour,et al. Claw-free graphs. I. Orientable prismatic graphs , 2007, J. Comb. Theory, Ser. B.

[8] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[9] Paul D. Seymour,et al. The roots of the independence polynomial of a clawfree graph , 2007, J. Comb. Theory B.

[10] Paul D. Seymour,et al. Claw-free graphs VI. Colouring , 2010, J. Comb. Theory, Ser. B.