A Fast Graph Program for Computing Minimum Spanning Trees

Brian Courtehoute, Detlef Plump

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Graph Computation Models (GCM 2020), Revised Selected Papers
Publisher	Open Publishing Association
Pages	163-180
Number of pages	18
DOIs	https://doi.org/10.4204/EPTCS.330.10
Publication status	Published - 3 Dec 2020

Name	Electronic Proceedings in Theoretical Computer Science
Volume	330

Access to Document

@inproceedings{990c664d55b0496db2e480f4dee1bb2a,

title = "A Fast Graph Program for Computing Minimum Spanning Trees",

author = "Brian Courtehoute and Detlef Plump",

year = "2020",

month = dec,

day = "3",

doi = "10.4204/EPTCS.330.10",

language = "English",

series = "Electronic Proceedings in Theoretical Computer Science",

publisher = "Open Publishing Association",

pages = "163--180",

booktitle = "Graph Computation Models (GCM 2020), Revised Selected Papers",

address = "Australia",

}

TY - GEN

T1 - A Fast Graph Program for Computing Minimum Spanning Trees

AU - Courtehoute, Brian

AU - Plump, Detlef

PY - 2020/12/3

Y1 - 2020/12/3

U2 - 10.4204/EPTCS.330.10

DO - 10.4204/EPTCS.330.10

M3 - Conference contribution

T3 - Electronic Proceedings in Theoretical Computer Science

SP - 163

EP - 180

BT - Graph Computation Models (GCM 2020), Revised Selected Papers

PB - Open Publishing Association

ER -