Finding minimum spanning trees on the EREW PRAM

Chong, Ka Wong

Local TagsRelease HistoryDetailsSummary

Finding minimum spanning trees on the EREW PRAM

Chong, K. W. (1996). Finding minimum spanning trees on the EREW PRAM. In International Computer Symposium (pp. 7-14). -: -.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB73-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AB74-5

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Chong, Ka Wong¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2010-03-02Date issued: 1996

Publication Status: Issued

Pages: -

Publishing info: - : -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 517698
Other: Local-ID: C1256428004B93B8-16B688F1F77B67FEC125648F0032AE06-Chong-1-96

Degree: -

Event

show

hide

Title: Untitled Event

Place of Event: Taiwan

Start-/End Date: 1996

Legal Case

show

Project information

show

Source 1

show

hide

Title: International Computer Symposium

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: - : -

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 7 - 14 Identifier: -