• Search in all Repository
  • Literature and maps
  • Archeology
  • Mills database
  • Natural sciences

Search in Repository

How to search...

Advanced search

Search in Literature and maps

How to search...

Advanced search

Search in Archeology

How to search...

Advanced search

Search in Mills database

How to search...

Advanced search

Search in Natural sciences

How to search...

Advanced search

RCIN and OZwRCIN projects

Object

Title: Evolutionary approach to obtain graph covering by densely connected subgraphs

Subtitle:

Raport Badawczy = Research Report ; RB/79/2011

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

849-875 stron ; 21 cm ; Bibliografia s. 873-875

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.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Raport

Resource Identifier:

oai:rcin.org.pl:217470

Source:

RB-2011-79

Language:

eng

Language of abstract:

eng

Rights:

Licencja Creative Commons Uznanie autorstwa 4.0

Terms of use:

Zasób chroniony prawem autorskim. [CC BY 4.0 Międzynarodowe] Korzystanie dozwolone zgodnie z licencją Creative Commons Uznanie autorstwa 4.0, której pełne postanowienia dostępne są pod adresem: ; -

Digitizing institution:

Instytut Badań Systemowych Polskiej Akademii Nauk

Original in:

Biblioteka Instytutu Badań Systemowych PAN

Projects co-financed by:

Program Operacyjny Polska Cyfrowa, lata 2014-2020, Działanie 2.3 : Cyfrowa dostępność i użyteczność sektora publicznego; środki z Europejskiego Funduszu Rozwoju Regionalnego oraz współfinansowania krajowego z budżetu państwa

Access:

Otwarty

Object collections:

Last modified:

Oct 19, 2021

In our library since:

Oct 19, 2021

Number of object content downloads / hits:

43

All available object's versions:

https://rcin.org.pl./publication/255082

Show description in RDF format:

RDF

Show description in RDFa format:

RDFa

Show description in OAI-PMH format:

OAI-PMH

Objects Similar

×

Citation

Citation style:

This page uses 'cookies'. More information