Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/5242| Title: | Proof regarding the NP-completeness of the weighted complex triangle elimination (CTE) problem for general adjacency graphs |
| Authors: | Roy, S Maulik, Ujjwal Bandyopadhyay, Sanghamitra |
| Keywords: | NP-completeness Complex triangle elimination General adjacency graphs |
| Issue Date: | 2001 |
| Citation: | Proc. IEE-Computers and Digital Techniques, v. 148, no. 6, p. 238-244 |
| URI: | http://hdl.handle.net/10263/5242 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| IPCDT-148-6-2001-P238-244.pdf | 1.13 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.