5 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…
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…
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…