File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Book Chapter: Parallel connectivity and minimum spanning trees
Title | Parallel connectivity and minimum spanning trees |
---|---|
Authors | |
Issue Date | 2008 |
Publisher | Springer |
Citation | Parallel connectivity and minimum spanning trees. In Encyclopedia of algorithms, p. 629-631. New York, NY: Springer, 2008 How to Cite? |
Persistent Identifier | http://hdl.handle.net/10722/118211 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lam, TW | en_HK |
dc.date.accessioned | 2010-09-26T07:54:26Z | - |
dc.date.available | 2010-09-26T07:54:26Z | - |
dc.date.issued | 2008 | en_HK |
dc.identifier.citation | Parallel connectivity and minimum spanning trees. In Encyclopedia of algorithms, p. 629-631. New York, NY: Springer, 2008 | en_HK |
dc.identifier.isbn | 9780387307701 | - |
dc.identifier.uri | http://hdl.handle.net/10722/118211 | - |
dc.language | eng | en_HK |
dc.publisher | Springer | en_HK |
dc.relation.ispartof | Encyclopedia of algorithms | en_HK |
dc.title | Parallel connectivity and minimum spanning trees | en_HK |
dc.type | Book_Chapter | en_HK |
dc.identifier.doi | 10.1007/978-0-387-30162-4_280 | - |
dc.identifier.hkuros | 163533 | en_HK |
dc.identifier.spage | 629 | en_HK |
dc.identifier.epage | 631 | en_HK |
dc.publisher.place | New York, NY | - |