Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discussed. One, based on linear programming, has been in prior use and is known to produce predictable results, although it was...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2007
|
| Online Access: | http://hdl.handle.net/10725/2771 http://dx.doi.org/10.1007/s00224-007-1328-0 http://link.springer.com/article/10.1007/s00224-007-1328-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|