A heuristic strong connectivity algorithm for large graphs

Adan Cosgaya-Lozano; Norbert Zeh

doi:10.1007/978-3-642-02011-7_12

A heuristic strong connectivity algorithm for large graphs

Adan Cosgaya-Lozano, Norbert Zeh

Pharmacology, Toxicology and Pharmaceutics

科研成果: 图书/报告稿件的类型 › 会议稿件

3 引用（Scopus）

源语言	英语
主期刊名	Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings
页	113-124
页数	12
DOI	https://doi.org/10.1007/978-3-642-02011-7_12
出版状态	已出版 - 2009
活动	8th International Symposium on Experimental Algorithms, SEA 2009 - Dortmund, 德国期限: 6月 4 2009 → 6月 6 2009

出版系列

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	5526 LNCS
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

会议

会议	8th International Symposium on Experimental Algorithms, SEA 2009
国家/地区	德国
市	Dortmund
时期	6/4/09 → 6/6/09

!!!ASJC Scopus Subject Areas

理论计算机科学
一般计算机科学

访问文件

10.1007/978-3-642-02011-7_12

其它文件与链接

引用此

Cosgaya-Lozano, A., & Zeh, N. (2009). A heuristic strong connectivity algorithm for large graphs. 在 Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings (页码 113-124). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5526 LNCS). https://doi.org/10.1007/978-3-642-02011-7_12

A heuristic strong connectivity algorithm for large graphs. / Cosgaya-Lozano, Adan; Zeh, Norbert.
Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings. 2009. 页码 113-124 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 5526 LNCS).

科研成果: 图书/报告稿件的类型 › 会议稿件

Cosgaya-Lozano, A & Zeh, N 2009, A heuristic strong connectivity algorithm for large graphs. 在 Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 5526 LNCS, 页码 113-124, 8th International Symposium on Experimental Algorithms, SEA 2009, Dortmund, 德国, 6/4/09. https://doi.org/10.1007/978-3-642-02011-7_12

@inproceedings{15b28f0d00f54e428c61b2a8424818cc,

title = "A heuristic strong connectivity algorithm for large graphs",

author = "Adan Cosgaya-Lozano and Norbert Zeh",

year = "2009",

doi = "10.1007/978-3-642-02011-7_12",

language = "English",

isbn = "3642020100",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "113--124",

booktitle = "Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings",

note = "8th International Symposium on Experimental Algorithms, SEA 2009 ; Conference date: 04-06-2009 Through 06-06-2009",

}

TY - GEN

T1 - A heuristic strong connectivity algorithm for large graphs

AU - Cosgaya-Lozano, Adan

AU - Zeh, Norbert

PY - 2009

Y1 - 2009

UR - http://www.scopus.com/inward/record.url?scp=68749098516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68749098516&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02011-7_12

DO - 10.1007/978-3-642-02011-7_12

M3 - Conference contribution

AN - SCOPUS:68749098516

SN - 3642020100

SN - 9783642020100

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 113

EP - 124

BT - Experimental Algorithms - 8th International Symposium, SEA 2009, Proceedings

T2 - 8th International Symposium on Experimental Algorithms, SEA 2009

Y2 - 4 June 2009 through 6 June 2009

ER -

A heuristic strong connectivity algorithm for large graphs

出版系列

会议

!!!ASJC Scopus Subject Areas

访问文件

其它文件与链接

指纹

引用此