• Decomposable Algorithms for Co...

Treffer: Decomposable Algorithms for Computing Minimum Spanning Tree

Title:
Decomposable Algorithms for Computing Minimum Spanning Tree
Distributed computing: IWDC 2003
Authors:
Khedr, A., Bhatnagar, R.
Source:
LECTURE NOTES IN COMPUTER SCIENCE. :33-44
Availability:
http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCCN050800203&indx=1&recIds=ETOCCN050800203
Database:
British Library Document Supply Centre Inside Serials & Conference Proceedings