OpenAlex
PricingAboutJobs
Log inGet started
Work

Depth-first search and linear graph algorithms

HTML

Year: 1971
Type: conference-paper
Source: Annual Symposium on Switching & Automata Theory
DOI: 10.1109/swat.1971.10
Author: Robert Tarjan
Institution: Stanford University
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: depth-first search, backtracking, biconnected components, strongly connected components, undirected graphs, directed graphs, graph algorithms, linear-time algorithms, space complexity, time complexity

Open Access status: closed

Funder: Hertz Foundation
OpenAlex ID: W2534652523
FWCI: 1.849
Cites: 12
Cited by: 771
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms