Talk:Path-based strong component algorithm: Difference between revisions
Content deleted Content added
←Created page with 'This algorithm was discovered by Cheriyan and Mehlhorn in 1996. So the algorithm should be called Cheriyan-Mehlhorn, or perhaps Cheriyan-Mehlhorn/Gabow ? Here is a...' |
No edit summary |
||
| Line 8: | Line 8: | ||
Full version (15 pages) of IPL article |
Full version (15 pages) of IPL article |
||
Supplementary material on DFS. |
Supplementary material on DFS. |
||
[[User:85.216.120.110|85.216.120.110]] 06:22, 24 September 2007 (UTC) |
|||
Revision as of 06:22, 24 September 2007
This algorithm was discovered by Cheriyan and Mehlhorn in 1996. So the algorithm should be called Cheriyan-Mehlhorn, or perhaps Cheriyan-Mehlhorn/Gabow ?
Here is an excerpts from Gabow's home page:
Path-based depth-first search for strong and biconnected components," Information Processing Letters 74, 2000, pp.107-114. Note added May 2006: Joseph Cheriyan and Kurt Mehlhorn published this algorithm several years before: "Algorithms for Dense Graphs and Networks on the Random Access Computer", Algorithmica 15, 1996, pp.521-549 postscript The final algorithms are the same, although they do not use the path-based approach for the high-level algorithm. Full version (15 pages) of IPL article Supplementary material on DFS.