Simple linear-time algorithms for counting independent sets in distance-hereditary graphs

A connected graph is distance-hereditary if any two vertices have the same distance in all of its connected induced subgraphs. This paper proposes a unified method for designing linear-time algorithms for counting independent sets and their two variants, independent dominating sets and independent p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics 2018-04, Vol.239, p.144-153
1. Verfasser:	Lin, Min-Sheng
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Counting problem Distance-hereditary graphs Graph theory Graphs Independent dominating sets Independent perfect dominating sets Independent sets Linear-time algorithms Studies Time
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	A connected graph is distance-hereditary if any two vertices have the same distance in all of its connected induced subgraphs. This paper proposes a unified method for designing linear-time algorithms for counting independent sets and their two variants, independent dominating sets and independent perfect dominating sets, in distance-hereditary graphs.
ISSN:	0166-218X 1872-6771
DOI:	10.1016/j.dam.2017.12.023