Proof regarding the NP-completeness of the weighted complex triangle elimination (CTE) problem for general adjacency graphs

Simple item page
dc.contributor.authorRoy, S
dc.contributor.authorMaulik, Ujjwal
dc.contributor.authorBandyopadhyay, Sanghamitra
dc.date.accessioned2013-02-22T06:08:51Z
dc.date.available2013-02-22T06:08:51Z
dc.date.issued2001
dc.identifier.citationProc. IEE-Computers and Digital Techniques, v. 148, no. 6, p. 238-244en_US
dc.identifier.urihttp://hdl.handle.net/10263/5242
dc.language.isoenen_US
dc.subjectNP-completenessen_US
dc.subjectComplex triangle eliminationen_US
dc.subjectGeneral adjacency graphsen_US
dc.titleProof regarding the NP-completeness of the weighted complex triangle elimination (CTE) problem for general adjacency graphsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
IPCDT-148-6-2001-P238-244.pdf
Size:
1.1 MB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science