Back to Results
—out of 5—out of 5—out of 5—out of 5—out of 5—out of 5
Magical Tome
- First published
- 1997
- Publisher
- Springer
- Pages
- 410 pages
- ISBN
- 9783540625599
Graph-Theoretic Concepts in Computer Science
The outer archives are busy
About this book
It is widely known that many NP-complete graph problems remain NP-complete even if restricted to bounded degree and regular graphs [3].
Match Score
Create a free account to see Match Scores on books the community has marked — once you’ve set your preferences.
Create free accountMarks of the Realm
Marks left by readers of this tome
No community marks yet — be the first to inscribe this tome.
Pacing
Horror / Dark Elements
Romance
Spice Level
LGBTQ+ Representation
Social & Political Themes in Stories