activity
20112021
most citedDistributed Algorithm to Locate Critical Nodes to Network Robustness based on Spectral Analysis

2 citations · 2 across the 7 of their papers we have counts for

collaborators

15 papers

cs.LG2021

A Survey on Embedding Dynamic Graphs

Claudio D. T. Barros, Matheus R. F. Mendonça, Alex B. Vieira +1

Embedding static graphs in low-dimensional vector spaces plays a key role in network analytics and inference, supporting applications like node classification, link prediction, and…

cs.LG2020

Efficient Information Diffusion in Time-Varying Graphs through Deep Reinforcement Learning

Matheus R. F. Mendonça, André M. S. Barreto, Artur Ziviani

Network seeding for efficient information diffusion over time-varying graphs~(TVGs) is a challenging task with many real-world applications. There are several ways to model this sp…

cs.IT2020

An Algorithmic Information Distortion in Multidimensional Networks

Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil +1

Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network m…

cs.LO2020

Emergence of complex data from simple local rules in a network game

Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani

As one of the main subjects of investigation in data science, network science has been demonstrated a wide range of applications to real-world networks analysis and modeling. For e…

cs.LO2020

On the existence of hidden machines in computational time hierarchies

Felipe S. Abrahão, Klaus Wehmuth, Artur Ziviani

Challenging the standard notion of totality in computable functions, one has that, given any sufficiently expressive formal axiomatic system, there are total functions that, althou…

cs.SI2020

Approximating Network Centrality Measures Using Node Embedding and Machine Learning

Matheus R. F. Mendonça, André M. S. Barreto, Artur Ziviani

Extracting information from real-world large networks is a key challenge nowadays. For instance, computing a node centrality may become unfeasible depending on the intended central…