Details
Isbn 10
354013641X
Isbn 13
9783540136415
Publish Date
January 19, 1987
Publishers
Springer
Number Of Pages
260
Subjects
Computer Science, Computers / Computer Science, Graph, Structures, Computers - General Information
Subtitle
Graph Algorithmus and NP-Completeness (Monographs in Theoretical Computer Science. An EATCS Series)
Language
eng
Cover Image
https://pub-b56f387ab1c54250b1ed7837e39f079e.r2.dev/entities/book/OL12771742M.webp
Cover Id
5208859
Openlibrary Work
OL8054338W
Physical Format
Hardcover
Edition Name
1 edition
Goodreads Id
284375

