Domination problems on P5-free graphs

The minimum roman dominating problem (denoted by γR(G), the weight of minimum roman dominating function of graph G) is a variant of the very well known minimum dominating set problem (denoted by γ(G), the cardinality of minimum dominating set of graph G). Both problems remain NP-Complete when restri...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	RAIRO. Informatique théorique et applications 2014-12, Vol.48 (5), p.541-549
Hauptverfasser:	Lin, Min Chih, Mizrahi, Michel J.
Format:	Artikel
Sprache:	eng
Schlagworte:	05C69 05C85 Algorithms dominating set Graphs Mathematical functions P5-free graphs Polynomials roman dominating function Weight
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!