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

### A new formulation and solution of the sequencing problem: algorithm

Applicationes Mathematicae

Similarity:

### A new algorithm for the three counterfeit coins problem.

Novi Sad Journal of Mathematics

Similarity:

### Algorithm 36. Transitive closure of a graph

Applicationes Mathematicae

Similarity:

### On the conjecture relating minimax and minimean complexity norms

Aplikace matematiky

Similarity:

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

ESAIM: Proceedings

Similarity:

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...

### A lower bound on the independence number of a graph in terms of degrees

Discussiones Mathematicae Graph Theory

Similarity:

For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

### Extending the MAX Algorithm for Maximum Independent Set

Discussiones Mathematicae Graph Theory

Similarity:

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.

### An efficient algorithm for the maximum distance problem.

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

### On-Line Computation and Maximum-Weighted Hereditary Subgraph Problems

The Yugoslav Journal of Operations Research

Similarity:

### Graph drawing by high-dimensional embedding.

Journal of Graph Algorithms and Applications

Similarity:

### Linear problems (with extended range) have linear optimal algorithms.

Aequationes mathematicae

Similarity:

### A factor graph based genetic algorithm

International Journal of Applied Mathematics and Computer Science

Similarity:

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...