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

dc.contributor.author	Roy, S
dc.contributor.author	Maulik, Ujjwal
dc.contributor.author	Bandyopadhyay, Sanghamitra
dc.date.accessioned	2013-02-22T06:08:51Z
dc.date.available	2013-02-22T06:08:51Z
dc.date.issued	2001
dc.identifier.citation	Proc. IEE-Computers and Digital Techniques, v. 148, no. 6, p. 238-244	en_US
dc.identifier.uri	http://hdl.handle.net/10263/5242
dc.language.iso	en	en_US
dc.subject	NP-completeness	en_US
dc.subject	Complex triangle elimination	en_US
dc.subject	General adjacency graphs	en_US
dc.title	Proof regarding the NP-completeness of the weighted complex triangle elimination (CTE) problem for general adjacency graphs	en_US
dc.type	Article	en_US