Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Francesco Gullo"'
Autor:
Alain Barrat, Francesco Bonchi, Francesco Gullo, Edoardo Galimberti, Martino Ciaperoni, Ciro Cattuto
Publikováno v:
ACM Transactions on Knowledge Discovery from Data (TKDD)
ACM Transactions on Knowledge Discovery from Data (TKDD), ACM, 2020, 15 (1), pp.1-44. ⟨10.1145/3418226⟩
ACM Transactions on Knowledge Discovery from Data (TKDD), 2020, 15 (1), pp.2. ⟨10.1145/3418226⟩
ACM Transactions on Knowledge Discovery from Data (TKDD), ACM, 2020, 15 (1), pp.1-44. ⟨10.1145/3418226⟩
ACM Transactions on Knowledge Discovery from Data (TKDD), 2020, 15 (1), pp.2. ⟨10.1145/3418226⟩
When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their temporal span (i.e., the period of time for which the high density hol
Multilayer networks are a powerful paradigm to model complex systems, where multiple relations occur between the same entities. Despite the keen interest in a variety of tasks, algorithms, and analyses in this type of network, the problem of extracti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab5d555cbd168d49dc8bde326c89171c
http://hdl.handle.net/11573/1363326
http://hdl.handle.net/11573/1363326
Publikováno v:
CIKM '18 Proceedings of the 27th ACM International Conference on Information and Knowledge Management
CIKM2018
CIKM2018, Oct 2018, Torino, Italy. pp.107-116, ⟨10.1145/3269206.3271767⟩
CIKM2018
CIKM2018, Oct 2018, Torino, Italy. pp.107-116, ⟨10.1145/3269206.3271767⟩
International audience; When analyzing temporal networks, a fundamental task is the identification of dense structures (i.e., groups of vertices that exhibit a large number of links), together with their temporal span (i.e., the period of time for wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f68458d241ba04c11be73105d0901d59
Autor:
David García-Soriano, Francesco Gullo, Francesco Bonchi, Nicolas Kourtellis, Natali Ruchansky
Publikováno v:
CIKM
We study the problem of extracting a selective connector for a given set of query vertices $Q \subseteq V$ in a graph $G = (V,E)$. A selective connector is a subgraph of $G$ which exhibits some cohesiveness property, and contains the query vertices b
Network reliability is a well-studied problem that requires to measure the probability that a target node is reachable from a source node in a probabilistic (or uncertain) graph, i.e., a graph where every edge is assigned a probability of existence.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d21acb00db4371eb70908811becd3b7c