Parallel decomposition of generalized series-parallel graphs

Chin Wen Ho, Sun-Yuan Hsieh, Gen Huey Chen

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

Generalized series-parallel (GSP) graphs belong to the class of decomposable graphs which can be represented by their decomposition trees. Given a decomposition tree of a GSP graph, there are many graph-theoretic problems which can be solved efficiently. An efficient parallel algorithm for constructing a decomposition tree of a given GSP graph is presented. It takes O(log n) time with C(m, n) processors on a CRCW PRAM, where C(m, n) is the number of processors required to find connected components of a graph with m edges and n vertices in logarithmic time. Based on our algorithmic results, we also derive some properties for GSP graphs, which may be of interest in and of themselves.

Original languageEnglish
Pages (from-to)407-417
Number of pages11
JournalJournal of Information Science and Engineering
Volume15
Issue number3
Publication statusPublished - 1999 May 1

All Science Journal Classification (ASJC) codes

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Parallel decomposition of generalized series-parallel graphs'. Together they form a unique fingerprint.

Cite this