Euclidean shortest paths : exact or approximate algorithms
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
Item type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
![]() |
Central Library | 004.015115 LI(EUC) (Browse shelf(Opens below)) | 1 | Available | 18101 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
No cover image available | ||
004.015115 GRO(SPA) Spanning tree results for graphs and multigraphs : a matrix-theoretic approach | 004.015115 HAR(GRA) Graph theory | 004.015115 KOC(GRA) Graphs, algorithms, and optimization | 004.015115 LI(EUC) Euclidean shortest paths : exact or approximate algorithms | 004.015115 MAR(CRO) Crossing numbers of graphs | 004.015115 MAR(MAG) Magic Graphs | 004.015115 MCK(TOP) Topics in intersection graph theory |
bill No. SAR/182/11, dt.18.01.2012
There are no comments on this title.