Reachability in O(log n) Genus Graphs is in Unambiguous Logspace.
Chetan GuptaVimal Raj SharmaRaghunath TewariPublished in: STACS (2019)
Keyphrases
- lower bound
- graph theory
- state space
- adjacency matrix
- structured objects
- graph clustering
- transitive closure
- graph theoretic
- worst case
- graph matching
- graph representation
- bipartite graph
- directed graph
- graph partitioning
- semi supervised
- graph data
- small world
- upper bound
- graph construction
- image segmentation
- neural network