Visualization of giant connected component in directed network

Klimková, Eva; Šenkeřík, Roman; Zelinka, Ivan

dc.title	Visualization of giant connected component in directed network	en
dc.contributor.author	Klimková, Eva
dc.contributor.author	Šenkeřík, Roman
dc.contributor.author	Zelinka, Ivan
dc.relation.ispartof	MENDEL 2011
dc.identifier.issn	1803-3814 Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn	978-80-214-4302-0
dc.date.issued	2011
utb.relation.volume	2011
dc.citation.spage	486
dc.citation.epage	491
dc.event.title	17th International Conference on Soft Computing MENDEL 2011
dc.event.location	Brno
utb.event.state-en	Czech Republic
utb.event.state-cs	Česká republika
dc.event.sdate	2011-06-15
dc.event.edate	2011-06-17
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	Vysoké učení technické v Brně	cs
dc.subject	Complex network	en
dc.subject	Directed network	en
dc.subject	Giant connected component	en
dc.subject	Tree	en
dc.subject	Growing network	en
dc.description.abstract	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.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1002813
utb.identifier.rivid	RIV/70883521:28140/11:43866524!RIV12-MSM-28140___
utb.identifier.obdid	43866645
utb.identifier.scopus	2-s2.0-84904194647
utb.identifier.wok	000302647900074
utb.source	d-wok
dc.date.accessioned	2012-06-04T11:34:11Z
dc.date.available	2012-06-04T11:34:11Z
utb.contributor.internalauthor	Klimková, Eva
utb.contributor.internalauthor	Šenkeřík, Roman
utb.contributor.internalauthor	Zelinka, Ivan