Reachability in O(log n) Genus Graphs is in Unambiguous.

Chetan Gupta Vimalraj Sharma Raghunath Tewari

Published in: Electron. Colloquium Comput. Complex. (2018)

Keyphrases

worst case
graph matching
graph theory
structured objects
graph representation
lower bound
graph structure
graph theoretic
state space
similarity measure
information systems
social networks
weighted graph
graph model
graph databases
neural network
graph construction
adjacency matrix
database