C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.
Alexander Russell
Ravi Sundaram
Published in:
Electron. J. Comb. (1998)
Keyphrases
</>
graph properties
computational complexity
graph theory
directed graph
special case
sufficient conditions
computationally efficient
markov chain
np complete
rate distortion
worst case
random walk
low complexity
graphical representation
large deviations