Hardness of Approximate Compaction for Nonplanar Orthogonal Graph Drawings
Michael J. BannisterDavid EppsteinPublished in: CoRR (2011)
Keyphrases
- graph representation
- weighted graph
- graph structure
- structured data
- graph theory
- information theoretic
- random walk
- connected components
- directed graph
- computational complexity
- phase transition
- worst case
- np hard
- learning algorithm
- line drawings
- graph model
- graph databases
- piecewise linear
- simple linear
- np hardness
- engineering drawings
- stable set