Abstract
We show that several combinatorial existence problems can be attacked by solving associated enumeration problems using a combination of dynamic programming and the principle of inclusion and exclusion. In comparison with the usual dynamic programming algorithms, the new methods have somewhat greater execution time but require far less storage.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
