Algorithms for multi-level graph planarity testing and layout.
Patrick HealyAgo KuusikPublished in: Theor. Comput. Sci. (2004)
Keyphrases
- graph theory
- orders of magnitude
- directed acyclic graph
- theoretical analysis
- optimization problems
- computationally efficient
- graph layout
- minimum spanning tree
- worst case
- data structure
- random walk
- machine learning algorithms
- significant improvement
- times faster
- computational complexity
- learning algorithm
- maximum clique
- neural network