Finding biconnected components in O(n) time for a class of graphs

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.


Download / Buy Article:

Keywords: Algorithms; Biconnected component; Breadth-first search

Document Type: Research Article


Affiliations: Department of Computer Science, Indiana Purdue University, Fort Wayne, IN 46805, USA

Publication date: November 11, 1996

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more