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

Roy, SMaulik, UjjwalBandyopadhyay, Sanghamitra2013-02-222013-02-222001Proc. IEE-Computers and Digital Techniques, v. 148, no. 6, p. 238-244http://hdl.handle.net/10263/5242enNP-completenessComplex triangle eliminationGeneral adjacency graphsProof regarding the NP-completeness of the weighted complex triangle elimination (CTE) problem for general adjacency graphsArticle