✦ LIBER ✦
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
✍ Scribed by Shin-ichi Nakayama; Shigeru Masuyama
- Book ID
- 108153518
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 161 KB
- Volume
- 103
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.