Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming

Kai Wang, Charles A. Phillips, Casey Miller, David G. Laughon, Michael A. Langston

Research output: Contribution to book or proceedingChapter

Abstract

This conference proceeding was published in Proceedings of the Annual Conference on Computational Science and Computational Intelligence.

Original languageAmerican English
Title of host publicationProceedings of the Annual Conference on Computational Science & Computational Intelligence
StatePublished - Dec 15 2017

Keywords

  • Boolean Satisfiability
  • Graph Algorithm Alternatives
  • Integer Linear Programming
  • Polynomial-Time Transformations

DC Disciplines

  • Computer Sciences

Fingerprint

Dive into the research topics of 'Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming'. Together they form a unique fingerprint.

Cite this