Displaying similar documents to “An algorithm for optimal partitioning of a graph”

On the conjecture relating minimax and minimean complexity norms

Peter Růžička, Juraj Wiedermann (1979)

Aplikace matematiky


Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.

Optimal placement of electrodes in an electroporation process

Nicolae Cîndea, Benoît Fabrèges, Frédéric de Gournay, Clair Poignard (2010)

ESAIM: Proceedings


Electroporation consists in increasing the permeability of a tissue by applying high voltage pulses. In this paper we discuss the question of optimal placement and optimal loading of electrodes such that electroporation holds only in a given open set of the domain. The electroporated set of the domain is where the norm of the electric field is above a given threshold value. We use a standard gradient algorithm to optimize the loading...

Extending the MAX Algorithm for Maximum Independent Set

Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)

Discussiones Mathematicae Graph Theory


The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.

A factor graph based genetic algorithm

B. Hoda Helmi, Adel T. Rahmani, Martin Pelikan (2014)

International Journal of Applied Mathematics and Computer Science


We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable...