1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.LG2022★ 1 cited
Improved analysis of randomized SVD for top-eigenvector approximation
Ruo-Chun Tzeng, Po-An Wang, Florian Adriaens +2
Computing the top eigenvectors of a matrix is a problem of fundamental interest to various fields. While the majority of the literature has focused on analyzing the reconstruction…
cs.DS2021★ 1 cited
Testing properties of signed graphs
Florian Adriaens, Simon Apers
In graph property testing the task is to distinguish whether a graph satisfies a given property or is "far" from having that property, preferably with a sublinear query and time co…
cs.DS2019
Discovering Interesting Cycles in Directed Graphs
Florian Adriaens, Cigdem Aslay, Tijl De Bie +2
Cycles in graphs often signify interesting processes. For example, cyclic trading patterns can indicate inefficiencies or economic dependencies in trade networks, cycles in food we…