408 citations · 2.6k across the 52 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2014★ 3 cited
A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations
Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne +1
Unique Sink Orientations (USOs) are an appealing abstraction of several major optimization problems of applied mathematics such as for instance Linear Programming (LP), Markov Deci…
cs.DM2014★ 2 cited
Zero forcing number, constrained matchings and strong structural controllability
Maguy Trefois, Jean-Charles Delvenne
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a sim…