Faces in the crowd
We study a pair of N P-hard problems aimed at finding small sets of faces in planar graphs. In the disk dimension problem, we are given a planar graph G, and seek the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary ofsome disk. Useful properties o...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5413 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://web.eecs.utk.edu/~langston/projects/papers/dd-and-fc.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|