A Fast Graph Program for Computing Minimum Spanning Trees

Courtehoute, Brian and Plump, Detlef orcid.org/0000-0002-1148-822X (2020) A Fast Graph Program for Computing Minimum Spanning Trees. In: Graph Computation Models (GCM 2020), Revised Selected Papers. Electronic Proceedings in Theoretical Computer Science . Open Publishing Association , pp. 163-180.

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Dates:
  • Published: 3 December 2020
  • Accepted: 5 October 2020
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 14 Dec 2020 12:00
Last Modified: 16 Oct 2024 11:12
Published Version: https://doi.org/10.4204/EPTCS.330.10
Status: Published
Publisher: Open Publishing Association
Series Name: Electronic Proceedings in Theoretical Computer Science
Identification Number: 10.4204/EPTCS.330.10
Open Archives Initiative ID (OAI ID):

Download

Export

Statistics


CORE (COnnecting REpositories)