arXiv Open Access 2010

NP-completeness Proof: RBCDN Reduction Problem

Sujogya Banerjee Shahrzad Shirazipourazad Pavel Ghosh Arunabha Sen

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (4)

Sujogya Banerjee

Shahrzad Shirazipourazad

Pavel Ghosh

Arunabha Sen

Format Sitasi

APA MLA BibTeX

Banerjee, S., Shirazipourazad, S., Ghosh, P., Sen, A. (2010). NP-completeness Proof: RBCDN Reduction Problem. https://arxiv.org/abs/1012.2142

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓