Finding strongly connected components in series parallel graphs

Afrati, F

dc.contributor.author	Afrati, F	en
dc.date.accessioned	2014-03-01T02:47:57Z
dc.date.available	2014-03-01T02:47:57Z
dc.date.issued	1991	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33470
dc.subject	Parallel Algorithm	en
dc.subject	Series-parallel Graph	en
dc.subject	Strongly Connected Component	en
dc.subject	Time Use	en
dc.subject	Series Parallel	en
dc.title	Finding strongly connected components in series parallel graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/TENCON.1991.753831	en
heal.identifier.secondary	http://dx.doi.org/10.1109/TENCON.1991.753831	en
heal.publicationDate	1991	en
heal.abstract	We present an efficient parallel algorithm which finds the strongly connected components of ii series-parallel digraph. The algorithm runs in O(log2n) time and uses O(n) processors. As a consequence, the reachability problem can be solved efficiently for seriesparallel digraphs in O(l.og2 n) parallel time using O(n) number of processors.	en
heal.journalName	TENCON, IEEE Region 10 International Conference	en
dc.identifier.doi	10.1109/TENCON.1991.753831	en