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

No Thumbnail Available

Date

2001

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Keywords

NP-completeness, Complex triangle elimination, General adjacency graphs

Citation

Proc. IEE-Computers and Digital Techniques, v. 148, no. 6, p. 238-244

Collections

Endorsement

Review

Supplemented By

Referenced By