Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14267
For citation please use:
Main Title: Efficient and practical modular decomposition
Author(s): Dahlhaus, Elias
Gustedt, Jens
McConnell, Ross
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15494
http://dx.doi.org/10.14279/depositonce-14267
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We give a simple recursive algorithm for modular decomposition of undirected graphs that runs in O(n + m α(m,n)) time. Previous algorithms with this bound are of theoretical use only. By adding some data structure tricks, we get a much simpler proof of an O(n+m) bound than was previously available. A key element of the algorithm is a procedure for finding a depth-first forest on the complement of a directed graph G in time proportional to the size of G.
Subject(s): algorithm
modular decomposition
computation
graphs
Issue Date: 1996
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: 1996, 524
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-524-1996.pdf
Format: Adobe PDF | Size: 167.72 kB
DownloadShow Preview
Thumbnail
Report-524-1996.ps
Format: Postscript | Size: 358.11 kB
Download

Item Export Bar

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