Paired-Domination Problem on Distance-Hereditary Graphs

A paired-dominating set of a graph G is a dominating set S of G such that the subgraph of G induced by S has a perfect matching. Haynes and Slater (Networks 32(3):199–206, 1998) introduced the concept of paired-domination and showed that the problem of determining minimum paired-dominating sets is N...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2020-10, Vol.82 (10), p.2809-2840
Hauptverfasser:	Lin, Ching-Chi, Ku, Keng-Chu, Hsu, Chan-Hung
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Science, Software Engineering Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Mathematics Mathematics of Computing Mathematics, Applied Physical Sciences Science & Technology Technology Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!