A hybrid graph representation for recursive backtracking algorithms
Many exact algorithms for NPNP -hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing number of graph modifications, such as deletions, that reduce the problem instance and have to be “taken back” frequently d...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5400 http://dx.doi.org/10.1007/978-3-642-14553-7_15 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://link.springer.com/chapter/10.1007/978-3-642-14553-7_15 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|