Title

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.

Share

COinS