Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings.
Michael J. BannisterDavid EppsteinPublished in: Graph Drawing (2011)
Keyphrases
- graph representation
- graph model
- graph theory
- structured data
- graph databases
- phase transition
- graph mining
- bipartite graph
- learning theory
- directed graph
- graph search
- random walk
- bayesian networks
- dependency graph
- graph based algorithm
- weighted graph
- graph construction
- graph structures
- random graphs
- graph theoretic
- spanning tree
- data sets
- connected components
- worst case
- search engine
- neural network