VISUALIZATION OF GIANT CONNECTED COMPONENT IN DIRECTED NETWORK
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F11%3A43866524" target="_blank" >RIV/70883521:28140/11:43866524 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
VISUALIZATION OF GIANT CONNECTED COMPONENT IN DIRECTED NETWORK
Original language description
This research is focused on the description as to how to find all giant connected components in directed network by means of developed algorithm. For experimental testing, the two selected examples of the growing complex networks with preferential linking were used within this research. Roulette-wheel selection method was used as a preferential selection algorithm in the task of generation of complex networks.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MENDEL 2011 17th International Conference on Soft Computing
ISBN
978-80-214-4302-0
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
486-491
Publisher name
VUT Brno
Place of publication
Brno
Event location
Brno
Event date
Jun 15, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—