Results 1 -
1 of
1
Pathwidth and Three-Dimensional Straight-Line Grid Drawings of Graphs
"... We prove that every n-vertex graph G with pathwidth pw(G) has a three-dimensional straight-line grid drawing with O(pw(G) n) volume. Thus for ..."
Abstract
-
Cited by 23 (12 self)
- Add to MetaCart
We prove that every n-vertex graph G with pathwidth pw(G) has a three-dimensional straight-line grid drawing with O(pw(G) n) volume. Thus for

