We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
d Abstract) Esther M. Arkin 1 Applied Mathematics and Statistics Stony Brook University Stony Brook, USA Joseph S. B. Mitchell 2 Applied Mathematics and Statistics Stony Brook Univ...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...