SnailVis: a Paradigm to Visualize Complex Networks

Autores
Beiró, Mariano G.; Busch, Jorge R.; Alvarez Hamelin, José Ignacio
Año de publicación
2010
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
We propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax-core of the k-core decomposition.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
complex networks
visualization
communities detection
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/152726
Acceder
id SEDICI_488d6f185bbddaa7386ed7d96afb7dc3
oai_identifier_str oai:sedici.unlp.edu.ar:10915/152726
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling SnailVis: a Paradigm to Visualize Complex NetworksBeiró, Mariano G.Busch, Jorge R.Alvarez Hamelin, José IgnacioCiencias Informáticascomplex networksvisualizationcommunities detectionWe propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax-core of the k-core decomposition.Sociedad Argentina de Informática e Investigación Operativa2010info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1682-1693http://sedici.unlp.edu.ar/handle/10915/152726enginfo:eu-repo/semantics/altIdentifier/url/http://39jaiio.sadio.org.ar/sites/default/files/39-jaiio-ast-16.pdfinfo:eu-repo/semantics/altIdentifier/issn/1850-2806info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:39:22Zoai:sedici.unlp.edu.ar:10915/152726Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:39:22.824SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv SnailVis: a Paradigm to Visualize Complex Networks
title SnailVis: a Paradigm to Visualize Complex Networks
spellingShingle SnailVis: a Paradigm to Visualize Complex Networks
Beiró, Mariano G.
Ciencias Informáticas
complex networks
visualization
communities detection
title_short SnailVis: a Paradigm to Visualize Complex Networks
title_full SnailVis: a Paradigm to Visualize Complex Networks
title_fullStr SnailVis: a Paradigm to Visualize Complex Networks
title_full_unstemmed SnailVis: a Paradigm to Visualize Complex Networks
title_sort SnailVis: a Paradigm to Visualize Complex Networks
dc.creator.none.fl_str_mv Beiró, Mariano G.
Busch, Jorge R.
Alvarez Hamelin, José Ignacio
author Beiró, Mariano G.
author_facet Beiró, Mariano G.
Busch, Jorge R.
Alvarez Hamelin, José Ignacio
author_role author
author2 Busch, Jorge R.
Alvarez Hamelin, José Ignacio
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
complex networks
visualization
communities detection
topic Ciencias Informáticas
complex networks
visualization
communities detection
dc.description.none.fl_txt_mv We propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax-core of the k-core decomposition.
Sociedad Argentina de Informática e Investigación Operativa
description We propose a new non-parametric and linear-complexity algorithm to visualize complex networks, which were previously decomposed in subsets according to some criteria. We show two representations: the first including all edges and vertices and the second, summarized, highlighting subsets and their relations. In this paper we use a community decomposition algorithm to generate the subsets; then we rank them by the number of inter-community connections. We also highlight the central core of each community, that is, the subset with the highest connectivity level, which is the kmax-core of the k-core decomposition.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/152726
url http://sedici.unlp.edu.ar/handle/10915/152726
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://39jaiio.sadio.org.ar/sites/default/files/39-jaiio-ast-16.pdf
info:eu-repo/semantics/altIdentifier/issn/1850-2806
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
1682-1693
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616267900649472
score 13.070432

Publicaciones similares