Networks
Our paper “Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques” has been presented at ICALP2016. Thanks to my coauthors: Alessio Conte, Roberto Grossi, and Luca Versari. Here below the abstract: Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This[…]
Here below the abstract of our new paper “Directing Road Networks by Listing Strong Orientations” presented at IWOCA2016. A connected road network with N nodes and L edges has K \leq L edges identified as one-way roads. In a feasible direction, these one-way roads are assigned a direction each, so that every node can reach[…]
Our paper “Listing Acyclic Orientations of Graphs with Single and Multiple Sources” has been accepted to be published at Latin American Theoretical Informatics Symposium, LATIN 2016 to be held in Ensenada, Mexico (April 11-15, 2016). The abstract follows. We study enumeration problems for the acyclic orientations of an undirected graph with n nodes and m[…]
Our paper “Clique Covering of Large Real-World Networks” has been accepted for publishing at 31st ACM Symposium on Applied Computing, that will be held in Pisa from 4th to 8th April 2016. Here the abstract is. The edge clique covering (ECC) problem deals with discovering a set of (possibly overlapping) cliques in a given network,[…]
Our paper “Computing Top-k Closeness Centrality Faster in Unweighted Graphs” has been accepted for ALENEX 2016 (Algorithms Engineering and Experiments). Thanks to all the coauthors Elisabetta Bergamini, Michele Borassi, Pierluigi Crescenzi and Henning Meyerhenke. This work is the result of a merge between our work (see here) and the work by Elisabetta and Henning. It’s a pleasure to start this new collaboration. This is the abstract[…]