A fast randomized LOGSPACE algorithm for graph connectivity

Author： Feige U.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.169, Iss.2, 1996-12, pp. : 147-160

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

-languages for sets and LOGSPACE computable graph transformers

By Lisitsa A.   Sazonov V.  

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 183-222

Elsevier

Access to resources Recommend Favorite

Graph extension with constant connectivity

By Ido Hideshi   Omatu Sigeru  

Artificial Life and Robotics, Vol. 10, Iss. 2, 2006-11 ,pp. : 189-193

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems

By Goodrich Michael   Tamassia Roberto   Triandopoulos Nikos  

Algorithmica, Vol. 60, Iss. 3, 2011-07 ,pp. : 505-552

Springer Publishing Company

Access to resources Recommend Favorite

A self-stabilising algorithm for 3-edge-connectivity

By Saifullah Abusayeed M.  

International Journal of High Performance Computing and Networking, Vol. 7, Iss. 1, 2011-02 ,pp. : 40-52

Inderscience Publishers

Access to resources Recommend Favorite

A graph-based clustering algorithm in large transaction

By Chen N.  

Intelligent Data Analysis, Vol. 5, Iss. 4, 2001-01 ,pp. : 327-338

Ios Press

Access to resources Recommend Favorite