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

By Bloem Roderick   Gabow Harold   Somenzi Fabio  

Formal Methods in System Design, Vol. 28, Iss. 1, 2006-01 ,pp. : 37-56

Springer Publishing Company

Access to resources Recommend Favorite

A Simple O(log N) Time Parallel Algorithm for Testing Isomorphism of Maximal Outerplanar Graphs

By Gupta S.S.   Sinha B.P.  

Journal of Parallel and Distributed Computing, Vol. 56, Iss. 2, 1999-02 ,pp. : 144-155

Academic Press

Access to resources Recommend Favorite

On-Line Construction of Two-Dimensional Suffix Trees in O(n² log n) Time

By Na Joong Chae   Giancarlo Raffaele   Park Kunsoo  

Algorithmica, Vol. 48, Iss. 2, 2007-06 ,pp. : 173-186

Springer Publishing Company

Access to resources Recommend Favorite

Perfect Information Leader Election in log* n+O(1) Rounds

By Russell A.   Zuckerman D.  

Journal of Computer and System Sciences, Vol. 63, Iss. 4, 2001-12 ,pp. : 612-626

Academic Press

Access to resources Recommend Favorite

A Unified Formulation for Massively Parallel Rigid Multibody Dynamics of O(log₂ n) Computational Complexity

By Jaramillo-Botero A.   Lorente A.C.I.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 6, 2002-06 ,pp. : 1001-1020

Academic Press

Access to resources Recommend Favorite