Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Computer science and especially heterogeneous distributed computing is an experimental science. Simulation, emulation, or in-situ implementation are complementary methodologies to...
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
We are concerned about a view in undergraduate computer science education, especially in the early courses, that it’s okay to be math-phobic and still prepare oneself to become ...
Charles Kelemen, Allen B. Tucker, Peter Henderson,...
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...