Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very large instances of the NP-hard vertex cover problem are comput...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2006
|
| Online Access: | http://hdl.handle.net/10725/2769 http://dx.doi.org/10.1007/s00453-006-1214-1 http://link.springer.com/article/10.1007/s00453-006-1214-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|