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
- 1989
- Publisher
- Not Avail
- Pages
- 459 pages
- ISBN
- 9783540507284
Graph-Theoretic Concepts in Computer Sciences
The outer archives are busy
About this book
The class of graphs with treewidth k has the property that many graph problems, which are NP-complete for arbitrary graphs, become solvable in polynomial time, when restricted to this class [4,3,6,9,18,17].
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