Large social networks visualization using the algorithm of the spanning tree with maximum number of leaves.

Cavique, Luís; Mendes, Armando B.

http://hdl.handle.net/10400.3/2183

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
EUROXXIVProgrammeWE-20SN.pdf		113.98 KB	Adobe PDF	Download

Send Feedback

Authors

Cavique, Luís

Mendes, Armando B.

Abstract(s)

In the web 2.0, social networks easily reach of thousands or millions of actors. A clear view of a small number of vertexes is easy to obtain. However, when the number of vertexes and edges increases, the view becomes incomprehensible. In this work, we intend to find the skeleton of the social network, by transforming the graph into a tree with the largest possible number of leaves, using the spanning tree algorithm with additional constraints.

Description

24th European Conference on Operational Research (EURO XXIV). Lisboa, 11 a 14 de Julho de 2010 (Comunicação).

Keywords

Complex Societal Problems Data Mining

URI

http://hdl.handle.net/10400.3/2183

Citation

Cavique, Luís e Mendes, Armando (2010). "Large social networks visualization using the algorithm of the spanning tree with maximum number of leaves". EURO XXIV, 24th European Conference on Operational Research, Lisboa, 11 a 14 de Julho de 2010 (Comunicação).