Abstract.
In this paper a parallel algorithm is given that, given a graph G=(V,E) , decides whether G is a series parallel graph, and, if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log \kern -1pt |E|log ^\ast \kern -1pt |E|) time and O(|E|) operations on an EREW PRAM, and O(log \kern -1pt |E|) time and O(|E|) operations on a CRCW PRAM. The results hold for undirected as well as for directed graphs.
Algorithms with the same resource bounds are described for the recognition of graphs of treewidth two, and for constructing tree decompositions of treewidth two. Hence efficient parallel algorithms can be found for a large number of graph problems on series parallel graphs and graphs with treewidth two. These include many well-known problems like all problems that can be stated in monadic second-order logic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received July 15, 1997; revised January 29, 1999, and June 23, 1999.
Rights and permissions
About this article
Cite this article
Bodlaender, H., van Antwerpen - de Fluiter, B. Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1 . Algorithmica 29, 534–559 (2001). https://doi.org/10.1007/s004530010070
Issue Date:
DOI: https://doi.org/10.1007/s004530010070