Algorithmic aspects of graph connectivity Hirosi Nagamochi and Toshihide Ibaraki
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Call number | Status | Date due | Barcode |
---|---|---|---|---|---|
![]() |
NISER LIBRARY | 004.421.2:519 NAG-A (Browse shelf(Opens below)) | R (REFERENCE) | 4473 |
Browsing NISER LIBRARY shelves Close shelf browser (Hides shelf browser)
004.42 KNU-A Art of computer programming vol.3: sorting and searching | 004.42 KNU-A Art of computer programming vol.1: fundamental algorithms | 004.42 KNU-A Art of computer programming vol.2: seminumerical algorithms (the) | 004.421.2:519 NAG-A Algorithmic aspects of graph connectivity | 004.421.5:510.51 MAT-R Randomized algorithms | 004.421 AHO-D Design and analysis of computer algorithms | 004.421 AHO-D Design and analysis of computer algorithms |
There are no comments on this title.