9532 search results - page 147 / 1907 » Logic, Graphs, and Algorithms |
PPAM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
182
click to vote
POPL
2009
ACM
16 years 1 days ago
2009
ACM
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
176
click to vote
AUSSOIS
2001
Springer
15 years 3 months ago
2001
Springer
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
EVOW
2007
Springer
15 years 5 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known