✦ LIBER ✦
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
✍ Scribed by Christoph Meinel
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 344 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.