@misc{Potrzebowski_Henryk_(1943–_)_Evolutionary_2011,
 author={Potrzebowski, Henryk (1943– ) and Sęp, Krzysztof and Stańczak, Jarosław},
 copyright={Creative Commons Attribution BY 4.0 license},
 address={Warszawa},
 journal={Raport Badawczy = Research Report},
 howpublished={online},
 year={2011},
 publisher={Instytut Badań Systemowych. Polska Akademia Nauk},
 publisher={Systems Research Institute. Polish Academy of Sciences},
 language={eng},
 abstract={This article describes two evolutionary methods for dividing a graph into densely connected structures. The first method deals with the clustering problem, where the element order plays an important role. This formulation is very useful for a wide range of Decision Support System (DSS) applications. The proposed clustering method consists of two stages. The first is the stage of data matrix reorganization, using a specialized evolutionary algorithm. The second stage is the final clustering step and is performed using a simple clustering method (SCM). The second described method deals with a completely new partitioning algorithm, based on the subgraph structure we call α-clique. The α-clique is a generalization of the clique concept with the introduction of parameter, which imposes for all vertices of the subgraph the minimal percentage (α∗100%) of vertices of this subgraph that must be connected with vertices of this-clique. Traditional clique is an instance of α-clique with α = 1. Application of this parameter makes it possible to control the degree (or strength) of connections among vertices (nodes) of this subgraph structure. The evolutionary approach is proposed as a method that enables finding separate -cliques that cover the set of graph vertices.},
 title={Evolutionary approach to obtain graph covering by densely connected subgraphs},
 type={Text},
 URL={http://rcin.org.pl/Content/217470/PDF/RB-2011-79.pdf},
}