51 citations · 101 across the 16 of their papers we have counts for
17 papers
Hypersparse Traffic Matrices from Suricata Network Flows using GraphBLAS
Michael Houle, Michael Jones, Dan Wallmeyer +8
Hypersparse traffic matrices constructed from network packet source and destination addresses is a powerful tool for gaining insights into network traffic. SuiteSparse: GraphBLAS,…
Superpixels algorithms through network community detection
Anthony Perez
Community detection is a powerful tool from complex networks analysis that finds applications in various research areas. Several image segmentation methods rely for instance on com…
An improved kernelization algorithm for Trivially Perfect Editing
Maël Dumas, Anthony Perez
In the Trivially Perfect Editing problem one is given an undirected graph and an integer and seeks to add or delete at most edges in to obtain a trivially p…
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph can be covered by shortest paths, then the pathwidth of is upper-bounded by a single-exponential function o…
Polynomial kernels for edge modification problems towards block and strictly chordal graphs
Maël Dumas, Anthony Perez, Mathis Rocton +1
We consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph and an integer and seeks to…
A cubic vertex-kernel for Trivially Perfect Editing
Maël Dumas, Anthony Perez, Ioan Todinca
We consider the Trivially Perfect Editing problem, where one is given an undirected graph and a parameter and seeks to edit (add or delete) at most $…