NP-completeness Proof: RBCDN Reduction Problem

Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Banerjee, Sujogya, Shirazipourazad, Shahrzad, Ghosh, Pavel, Sen, Arunabha
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computational Complexity
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Computational complexity of the design problem for a network with a target value of Region-Based Component Decomposition Number (RBCDN) has been proven to be NP-complete.
DOI:	10.48550/arxiv.1012.2142