39 citations · 57 across the 9 of their papers we have counts for
10 papers
On Computing Optimal Temporal Branchings and Spanning Subgraphs
Daniela Bubboloni, Costanza Catalano, Andrea Marino +1
In this work we extend the concept of out/in-branchings spanning the vertices of a digraph (also called directed spanning trees) to temporal graphs, which are digraphs where arcs a…
On Computing Large Temporal (Unilateral) Connected Components
Isnard Lopes Costa, Raul Lopes, Andrea Marino +1
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime, . Paths are sequences of adjacent edges whose appearing times are ei…
Menger's Theorem for Temporal Paths (Not Walks)
Allen Ibiapina, Raul Lopes, Andrea Marino +1
A (directed) temporal graph is a (directed) graph whose edges are available only at specific times during its (discretized) lifetime . In this setting, we ask that walks respect…
MaxCut on Permutation Graphs is NP-complete
Celina M. H. de Figueiredo, Alexsander A. de Melo, Fabiano S. Oliveira +1
In this paper, we prove that the MaxCut problem is NP-complete on permutation graphs, settling a long-standing open problem that appeared in the 1985 column of the "Ongoing Guide t…
Machine Learning for Performance Prediction of Spark Cloud Applications
Alexandre Maros, Fabricio Murai, Ana Paula Couto da Silva +5
Big data applications and analytics are employed in many sectors for a variety of goals: improving customers satisfaction, predicting market behavior or improving processes in publ…
You Shall not Pass: Avoiding Spurious Paths in Shortest-Path Based Centralities in Multidimensional Complex Networks
Klaus Wehmuth, Artur Ziviani, Leonardo Chinelate Costa +2
In complex network analysis, centralities based on shortest paths, such as betweenness and closeness, are widely used. More recently, many complex systems are being represented by…
Towards Understanding Political Interactions on Instagram
Martino Trevisan, Luca Vassio, Idilio Drago +5
Online Social Networks (OSNs) allow personalities and companies to communicate directly with the public, bypassing filters of traditional medias. As people rely on OSNs to stay up-…
Modelos de Resposta para Experimentos Randomizados em Redes Sociais de Larga Escala
Francisco Galuppo Azevedo, Bruno Demattos Nogueira, Fabricio Murai +1
A/B tests are randomized experiments frequently used by companies that offer services on the Web for assessing the impact of new features. During an experiment, each user is random…
Mixtape Application: Last.fm Data Characterization
Luciana Fujii Pontello, Pedro H. F. Holanda, Bruno Guilherme +3
This report analyses data collected from Last.fm and used to create a real-time recommendation system. We collected over 2M songs and 1M tags and 372K user's listening habits. We c…
Time Centrality in Dynamic Complex Networks
Eduardo Chinelate Costa, Alex Borges Vieira, Klaus Wehmuth +2
There is an ever-increasing interest in investigating dynamics in time-varying graphs (TVGs). Nevertheless, so far, the notion of centrality in TVG scenarios usually refers to metr…