A fast graph program for computing minimum spanning trees

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

When using graph transformation rules to implement graph algorithms, a challenge is to match the efficiency of programs in conventional languages. To help overcome that challenge, the graph programming language GP 2 features rooted rules which, under mild conditions, can match in constant time on bounded degree graphs. In this paper, we present an efficient GP 2 program for computing minimum spanning trees. We provide empirical performance results as evidence for the program’s subquadratic complexity on bounded degree graphs. This is achieved using depth-first search as well as rooted graph transformation. The program is based on Boruvka’s algorithm for minimum spanning trees. Our performance results show that the program’s time complexity is consistent with that of classical implementations of Boruvka’s algorithm, namely O(m log n), where m is the number of edges and n the number of nodes.

Cite

CITATION STYLE

APA

Courtehoute, B., & Plump, D. (2020). A fast graph program for computing minimum spanning trees. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 330, pp. 163–180). Open Publishing Association. https://doi.org/10.4204/EPTCS.330.10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free