A linear-time algorithm for the identifying code problem on block graphs

The identifying code problem is a special search problem, challenging both from a theoretical and from a computational point of view, even for several graphs where other usually hard problems are easy to solve, like bipartite graphs or chordal graphs. Hence, a typical line of attack for this problem...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Electronic notes in discrete mathematics 2017-11, Vol.62, p.249-254
Hauptverfasser:	Argiroffo, Gabriela R., Bianchi, Silvia M., Lucarini, Yanina, Wagler, Annegret K.
Format:	Artikel
Sprache:	eng
Schlagworte:	block graphs computational complexity Computer Science Discrete Mathematics identifying codes
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!