Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1

被引：0
|
作者：
H. L. Bodlaender
B. van Antwerpen - de Fluiter
机构：
[1] This research was carried out while the second author was working at the Department of Computer Science of Utrecht University,
[2] with support by the Foundation for Computer Science (S.I.O.N) of the Netherlands Organization for Scientific Research (N.W.O.). This research was partially supported by ESPRIT Long Term Research Project 20244 (project ALCOM IT: $Algorithms and Complexity
[3] Altera Corp.,undefined
[4] 101 Innovation Drive,undefined
[5] San Jose,undefined
[6] CA 95134,undefined
[7] USA. babette\_van\_antwerpen@hotmail.com.,undefined
来源：
Algorithmica | 2001年 / 29卷
关键词：
Key words. Graph algorithms, Parallel algorithms, Treewidth, Series parallel graphs, Partial k -trees.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：534 / 559
页数：25
相关论文
共 50 条
12345