Counting independent sets in a tolerance graph

Counting independent sets is a #P-complete problem for general graphs but solvable in polynomial time for interval and permutation graphs. This paper develops some polynomial time algorithms for counting independent sets, maximal independent sets, and independent perfect dominating sets in a toleran...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2015-01, Vol.181, p.174-184
Hauptverfasser:	Lin, Min-Sheng, Su, Sheng-Huang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Counting Counting problem Graphs Independent perfect dominating sets Independent sets Intervals Mathematical analysis Maximal independent sets Permutations Polynomials Tolerance graphs Tolerances
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!