Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FMCAD
2000
Springer

favoriteEmaildiscussreport

118views Formal Methods» more FMCAD 2000»

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

13 years 8 months ago

An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps

Download www.ist.tugraz.at

We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the number of nodes in the graph. This is an improvement over the previously known quadratic bound. The algorithm can be used to decide emptiness of B

Roderick Bloem, Harold N. Gabow, Fabio Somenzi

Real-time Traffic

Algorithm | FMCAD 2000 | Formal Methods | Quadratic Bound | Strongly Connected Component |

claim paper

Related Content

» Computing and Updating the Process Number in Trees

» Discrete Symbol Calculus

» Binomial Graph A Scalable and FaultTolerant Logical Network Topology

» A Note on the RoadColoring Conjecture

» A Fourier Theory for Cast Shadows

» Generalized feedback detection for spatial multiplexing multiantenna systems

» Online and stochastic survivable network design

» Reeb graphs approximation and persistence

» The DMM bound multivariate aggregate separation bounds

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	FMCAD
Authors	Roderick Bloem, Harold N. Gabow, Fabio Somenzi

Comments (0)