载入...
Optimal In-place Algorithms for Basic Graph Problems
We present linear time in-place algorithms for several fundamental graph problems including the well-known graph search methods (like depth-first search, breadth-first search, maximum cardinality search), connectivity problems (like biconnectivity, 2-edge connectivity), decomposition problem (like c...
| Autores principales: | , , |
|---|---|
| 格式: | Online 文件 Texto |
| 语言: | English |
| 出版: |
2020
|
| 主题: | |
| 在线阅读: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254905/ http://dx.doi.org/10.1007/978-3-030-48966-3_10 |