On the disk dimension of planar graphs
The disk dimension problem was introduced by Fellows and Langston in 1987. The disk dimension of a graph, G, is the least k for which G embeds in the plane minus k open disks, with every vertex of G on a boundary of one of the disks. Disk dimension finds application in circuit layout and related fie...
Saved in:
| Main Author: | |
|---|---|
| Format: | conferenceObject |
| Published: |
2011
|
| Online Access: | http://hdl.handle.net/10725/7596 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://at.yorku.ca/c/a/g/s/70.htm |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|