✦ LIBER ✦
Proof regarding the NP-completeness of the unweighted complex-triangle elimination (CTE) problem for general adjacency graphs
✍ Scribed by Roy, S.; Bandyopadhyay, S.; Maulik, U.
- Book ID
- 114448489
- Publisher
- The Institution of Electrical Engineers
- Year
- 2001
- Tongue
- English
- Weight
- 214 KB
- Volume
- 148
- Category
- Article
- ISSN
- 1350-2387
No coin nor oath required. For personal study only.