Depth- first search and linear graph algorithms

Research output: Contribution to conferencePaper

134 Scopus citations

Abstract

An algorithm for finding the biconnected components of an undirected graph and an improved version of an algorithm for finding the strongly connected components of a directed graph are presented.

Original languageEnglish (US)
Pages114-121
Number of pages8
StatePublished - Jan 1 1971
EventIEEE Conf Rec 1971 12th annu symp on switching & automata theory - East Lansing, Mich
Duration: Oct 13 1971Oct 15 1971

Other

OtherIEEE Conf Rec 1971 12th annu symp on switching & automata theory
CityEast Lansing, Mich
Period10/13/7110/15/71

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Depth- first search and linear graph algorithms'. Together they form a unique fingerprint.

  • Cite this

    TARJAN R, R. (1971). Depth- first search and linear graph algorithms. 114-121. Paper presented at IEEE Conf Rec 1971 12th annu symp on switching & automata theory, East Lansing, Mich, .