✦ LIBER ✦
An approximation algorithm for finding ad-regular spanning connected subgraph of maximum weight in a complete graph with random weights of edges
✍ Scribed by A. E. Baburin; E. Kh. Gimadi
- Book ID
- 111471165
- Publisher
- Pleiades Publishing
- Year
- 2008
- Tongue
- English
- Weight
- 713 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1990-4789
No coin nor oath required. For personal study only.