Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14378
For citation please use:
Main Title: Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel
Author(s): Gustedt, Jens
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15605
http://dx.doi.org/10.14279/depositonce-14378
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: For each minor-closed graph class we show that a simple variant of Boruvka's algorithm computes a MST for any input graph belonging to that class with linear costs. Among minor-closed graph classes are e.g planar graphs, graphs of bounded genus, partial k-trees for fixed k, and linkless or knotless embedable graphs. The algorithm can be implemented on a CRCW PRAM to run in logarithmic time with a work load that is linear in the size of the graph. We develop a new technique to find multiple edges in such a graph that might have applications in other parallel reduction algorithms as well.
Subject(s): spanning trees
minor-closed graph class
Boruvka's algorithm
MST
Issue Date: 1997
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 1997, 566
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-566-1997.pdf
Format: Adobe PDF | Size: 133.78 kB
DownloadShow Preview
Thumbnail
Report-566-1997.ps
Format: Postscript | Size: 189.56 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.