Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming
Document Type
Conference Proceeding
Publication Date
12-15-2017
Publication Title
Proceedings of the Annual Conference on Computational Science & Computational Intelligence
Abstract
This conference proceeding was published in Proceedings of the Annual Conference on Computational Science and Computational Intelligence.
Recommended Citation
Wang, Kai, Charles A. Phillips, Casey Miller, David G. Laughon, Michael A. Langston.
2017.
"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 Las Vegas, NV.
source: https://americancse.org/events/csci2017
https://digitalcommons.georgiasouthern.edu/compsci-facpubs/76
