Topics in graph algorithms
Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP-complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2003
|
| Online Access: | http://hdl.handle.net/10725/7494 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php http://trace.tennessee.edu/utk_graddiss/1954/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|