4926 search results - page 131 / 986 » Two Graph Algorithms On an Associative Computing Model |
134
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
169
Voted
GECCO
2010
Springer
15 years 8 months ago
2010
Springer
The island model for evolutionary algorithms allows to delay the global convergence of the evolution process and encourage diversity. However, solving large size and time-intensiv...
151
click to vote
MP
1998
15 years 4 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
130
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
136
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...