22 citations · 38 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
Étienne Grandjean, Louis Jachiet
In this paper, we study the class of operations , of any fixed arity , satisfying the following property: for each…
cs.DS2022
Tailored vertex ordering for faster triangle listing in large graphs
Fabrice Lécuyer, Louis Jachiet, Clémence Magnien +1
Listing triangles is a fundamental graph problem with many applications, and large graphs require fast algorithms. Vertex ordering allows the orientation of edges from lower to hig…
cs.DS2017★ 22 cited
A Circuit-Based Approach to Efficient Enumeration
Antoine Amarilli, Pierre Bourhis, Louis Jachiet +1
We study the problem of enumerating the satisfying valuations of a circuit while bounding the delay, i.e., the time needed to compute each successive valuation. We focus on the cla…