Solving medium to large sized euclidean generalized minimum spanning tree problems /

Saved in:
Bibliographic Details
OCLC:60451428
Main Author: Ghosh, Diptesh
Corporate Author: Indian Institute of Management, Ahmedabad
Language:English
Published: Ahmedabad : Indian Institute of Management, 2003.
Series:Working paper (Indian Institute of Management, Ahmedabad) ; W.P. no. 2003-08-02.
Subjects:
Trees (Graph theory) > Data processing.
Euclidean algorithm > Data processing.
Fault-tolerant computing.
Format:

Monograph Microform

Note that CRL will digitize material from the collection when copyright allows.

Borrow this resource

Notes

FICHE 2003

Item List

Description Local Call Number Status
FICHE Available

Similar Items