Embeddings of � -connected graphs of pathwidth (2000)

by A GUPTA, N NISHIMURA, A PROSKUROWSKI, P RAGDE
Venue:Proc. 7th Scandinavian Workshop on Algorithm Theory (SWAT ’00
Add To MetaCart
Results 1 - 1 of 1

Pathwidth and Three-Dimensional Straight-Line Grid Drawings of Graphs

by Vida Dujmovic, Pat Morin, David R. Wood
"... 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