✦ LIBER ✦
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
✍ Scribed by Egon Balas
- Book ID
- 104182980
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 540 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.