Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree 
Problem

Local TagsRelease HistoryDetailsSummary

Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem

Zaroliagis, C. (1997). Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem. Parallel Processing Letters, 7(1), 25-37.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39A9-5 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-39AA-3

Genre: Journal Article

show

show

hide

Creators:
Zaroliagis, Christos¹, Author

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

show

show

hide

Language(s): eng - English

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

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 517925
Other: Local-ID: C1256428004B93B8-7EC7BF18CE0E4DDFC12565DE0035DE63-Zaroliagis97PPL

Degree: -

show

show

show

show

hide

Title: Parallel Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 7 (1) Sequence Number: - Start / End Page: 25 - 37 Identifier: -