5473 search results - page 876 / 1095 » On the graph isomorphism problem |
167
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
168
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
164
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Mult...
140
click to vote
FSTTCS
1998
Springer
15 years 10 months ago
1998
Springer
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
181
click to vote
PLILP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...