A direct algorithm for the parameterized face cover problem
With respect to a given plane graph, G, a face cover is defined as a set of faces whose boundaries collectively contain every vertex in G. It is known that, when k is fixed, finding a cover of size k (if indeed any exist) can be accomplished in polynomial time. Recent improvements to face cover algo...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5411 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|