Login / Signup
Low-Memory Tour Reversal in Directed Graphs.
Viktor Mosenkis
Uwe Naumann
Elmar Peise
Published in:
Combinatorial Scientific Computing (2009)
Keyphrases
</>
directed graph
low memory
traveling salesman problem
random walk
memory requirements
directed acyclic graph
image coding algorithm
undirected graph
graph structure
high quality
graph structures
transform coding
strongly connected
multiresolution