1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5242
Full metadata record
DC FieldValueLanguage
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
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
IPCDT-148-6-2001-P238-244.pdf1.13 MBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.