Login / Signup
A Heuristic Approach Towards Drawings of Graphs with High Crossing Resolution.
Michael A. Bekos
Henry Förster
Christian Geckeler
Lukas Holländer
Michael Kaufmann
Amadäus M. Spallek
Jan Splett
Published in:
Graph Drawing (2018)
Keyphrases
</>
high resolution
dynamic programming
simulated annealing
wide range
graph matching
graph model
graph search
symbol recognition
search algorithm
scheduling problem
tabu search
graph representation
graph data
minimum spanning tree
subgraph isomorphism