Maximizing drawn edge length in partial edge drawings is NP-hard for 3-plane symmetric drawings and 4-plane general drawings, but becomes efficiently solvable when the edge-intersection graph has bounded treewidth.
In: Salvagnin, D., Lombardi, M
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Maximizing Ink in Partial Edge Drawings of k-plane Graphs
Maximizing drawn edge length in partial edge drawings is NP-hard for 3-plane symmetric drawings and 4-plane general drawings, but becomes efficiently solvable when the edge-intersection graph has bounded treewidth.