EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

15157 Distributed Algorithms for SCC Decomposition

Home Policy Brochure Browse Search User Area Contact Help

Barnat, J. and Chaloupka, J. and van de Pol, J.C. (2009) Distributed Algorithms for SCC Decomposition. Journal of Logic and Computation, 21 (1). pp. 23-44. ISSN 0955-792X *** ISI Impact 0,789 ***

Full text available as:

	PDF (Publisher's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 424 Kb
	PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 346 Kb

Official URL: http://dx.doi.org/10.1093/logcom/exp003

Abstract

We study existing parallel algorithms for the decomposition of a partitioned graph into its strongly connected components (SCCs). In particular, we identify several individual procedures that the algorithms are assembled from and show how to assemble a new and more efficient algorithm, called Recursive OBF (OBFR), to solve the decomposition problem. We also report on a thorough experimental study to evaluate the new algorithm. It shows that it is possible to perform SCC decomposition in parallel efficiently and that OBFR, if properly implemented, is the best choice in most cases.

Item Type:	Article
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
Research Project:	veriGEM: A Verification Grid for Enhanced Model Checking, EC-MOAN: Scalable Modelling and Analysis Techniques to study Emergent Cell Behaviour – understanding the E. coli stress response
Additional Information:	Advance Access since March 2009
ID Code:	15157
Status:	Published
Deposited On:	02 September 2009
Refereed:	Yes
International:	Yes
ISI Impact Factor:	0,789
More Information:	statistics metis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item