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:
Comput. J. (2021)
Keyphrases
</>
search algorithm
wide range
graph matching
line drawings
optimal solution
dynamic programming
heuristic search
minimum spanning tree
graph theoretic
series parallel
data sets
graph search
spanning tree
graph structure
graph theory
constraint satisfaction
simulated annealing
neural network