Login / Signup
How to meet when you forget: log-space rendezvous in arbitrary graphs.
Jurek Czyzowicz
Adrian Kosowski
Andrzej Pelc
Published in:
Distributed Comput. (2012)
Keyphrases
</>
arbitrary dimension
graph theory
higher dimensional
directed graph
machine learning
search engine
feature selection
low dimensional
user defined
parameter space
graph matching
weighted graph
graph mining
graph theoretic
series parallel
spectral decomposition