Triangles as basis to detect communities: an application to Twitter's network

Autor: Abdelsadek, Youcef, Chelghoum, Kamel, Herrmann, Francine, Kacem, Imed, Otjacques, Benoît

Nowadays, the interest given by the scientific community to the investigation of the data generated by social networks is increasing as much as the exponential increasing of social network data. The data structure complexity is one among the snags, w

Externí odkaz: http://arxiv.org/abs/1606.05136

A universal cellular automaton in the hyperbolic plane

Autor: Herrmann, Francine, Margenstern, Maurice ^*

Publikováno v: In Theoretical Computer Science 8 March 2003 296(2):327-364

Towards an Efficient Handling of the Maximum Triangle Packing Problem

Autor: Abdelsadek, Youcef, Herrmann, Francine, Kacem, Imed, Otjacques, Benoît

This work addresses the problem of finding the maximum number of unweighted vertex-disjoint triangles in an undirected graph G. It is a challenging NP-hard problem in combinatorics and it is well-known to be APX-hard. We propose two heuristics for th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f4b3c972c8215ac149391635a6d27ed4
https://hal.science/hal-01283957

On the Community Identification in Weighted Time-Varying Networks.

Autor: Abdelsadek, Youcef, Chelghoum, Kamel, Herrmann, Francine, Kacem, Imed, Otjacques, Benoȋt

Publikováno v: Swarm Intelligence Based Optimization: Second International Conference, ICSIBO 2016, Mulhouse, France, June 13-14, 2016, Revised Selected Papers; 2016, p111-123, 13p

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.