Login / Signup

A Fast Adaptive Layout Algorithm for Undirected Graphs.

Arne FrickAndreas LudwigHeiko Mehldau
Published in: Graph Drawing (1994)
Keyphrases
  • undirected graph
  • np hard
  • computational complexity
  • objective function
  • expectation maximization
  • learning algorithm
  • search space
  • dynamic programming
  • lower bound
  • random variables
  • graph structure
  • random graphs