File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Book Chapter: Parallel connectivity and minimum spanning trees

TitleParallel connectivity and minimum spanning trees
Authors
Issue Date2008
PublisherSpringer
Citation
Parallel connectivity and minimum spanning trees. In Encyclopedia of algorithms, p. 629-631. New York, NY: Springer, 2008 How to Cite?
Persistent Identifierhttp://hdl.handle.net/10722/118211
ISBN

 

DC FieldValueLanguage
dc.contributor.authorLam, TWen_HK
dc.date.accessioned2010-09-26T07:54:26Z-
dc.date.available2010-09-26T07:54:26Z-
dc.date.issued2008en_HK
dc.identifier.citationParallel connectivity and minimum spanning trees. In Encyclopedia of algorithms, p. 629-631. New York, NY: Springer, 2008en_HK
dc.identifier.isbn9780387307701-
dc.identifier.urihttp://hdl.handle.net/10722/118211-
dc.languageengen_HK
dc.publisherSpringeren_HK
dc.relation.ispartofEncyclopedia of algorithmsen_HK
dc.titleParallel connectivity and minimum spanning treesen_HK
dc.typeBook_Chapteren_HK
dc.identifier.doi10.1007/978-0-387-30162-4_280-
dc.identifier.hkuros163533en_HK
dc.identifier.spage629en_HK
dc.identifier.epage631en_HK
dc.publisher.placeNew York, NY-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats