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

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

Research output: Contribution to book or proceeding › Conference article › peer-review

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.

Computer Science

Engineering

Earth and Planetary Sciences