Contribution to Book
Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming
Proceedings of the Annual Conference on Computational Science & Computational Intelligence
Document Type
Conference Proceeding
Publication Date
12-15-2017
Disciplines
Abstract
This conference proceeding was published in Proceedings of the Annual Conference on Computational Science and Computational Intelligence.
Citation Information
Kai Wang, Charles A. Phillips, Casey Miller, David G. Laughon, et al.. "Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming" Las Vegas, NVProceedings of the Annual Conference on Computational Science & Computational Intelligence (2017) Available at: http://works.bepress.com/kai-wang/5/