中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
题名:
Depth-First Search and Linear Graph Algorithms
作者: Robert Tarjan
刊名: SIAM Journal on Computing
发表日期: 1972
卷: 1, 期:2, 页:146-160
收录类别: 其他
合作性质: 其它
英文摘要: The value of depth-first search or "backtracking" as a technique for solving problems is illustrated by two examples. An improved version of an algorithm for finding the strongly connected components of a directed graph and at algorithm for finding the biconnected components of an undirect graph are presented. The space and time requirements of both algorithms are bounded by $k_1 V + k_2 E + k_3 $ for some constants $k_1 ,k_2 $, and $k_3 $, where $V$ is the number of vertices and $E$ is the number of edges of the graph being examined.
语种: 英语
内容类型: 期刊论文
URI标识: http://ir.iscas.ac.cn/handle/311060/1322
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:
File Name/ File Size Content Type Version Access License
bj01134931.pdf(1915KB)----限制开放 联系获取全文

Recommended Citation:
Robert Tarjan. Depth-First Search and Linear Graph Algorithms[J]. SIAM Journal on Computing,1972-01-01,1(2):146-160.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Robert Tarjan]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Robert Tarjan]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace