Deciding st-connectivity in undirected graphs using logarithmic space
Main Author: | Maceli, Peter Lawson |
---|---|
Language: | English |
Published: |
The Ohio State University / OhioLINK
2008
|
Subjects: | |
Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=osu1211753530 |
Similar Items
-
On topological spaces generated by simple undirected graphs
by: Hatice Kübra Sarı, et al.
Published: (2020-07-01) -
Infinite Ergodic Walks in Finite Connected Undirected Graphs
by: Dimitri Volchenkov
Published: (2021-02-01) -
Space-Efficient Fully Dynamic DFS in Undirected Graphs <sup>†</sup>
by: Kengo Nakamura, et al.
Published: (2019-02-01) -
The search for minimal edge 1-extension of an undirected colored graph
by: Razumovsky, Peter Vladimirovich
Published: (2021-08-01) -
Connectivity of Semiring Valued Graphs
by: Shyam Sundar Santra, et al.
Published: (2021-07-01)