9 citations · 11 across the 2 of their papers we have counts for
3 papers
math.NA2016★ 9 cited
Sparse matrix factorizations for fast linear solvers with application to Laplacian systems
Michael T. Schaub, Maguy Trefois, Paul Van Dooren +1
In solving a linear system with iterative methods, one is usually confronted with the dilemma of having to choose between cheap, inefficient iterates over sparse search directions…
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…
math.CO2012
Computing the minimum rank of a loop directed tree
Maguy Trefois, Jean-Charles Delvenne
The minimum rank of a graph is the minimum possible rank of a real matrix whose zero-nonzero pattern is described by the graph. The current algorithms can compute efficiently the m…