4 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.CC2023★ 4 cited
Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies
Dominique Barth, Thierry Mautor, Dimitri Watel +1
We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each product…
cs.DS2014★ 3 cited
A Bit-Parallel Russian Dolls Search for a Maximum Cardinality Clique in a Graph
Ricardo C. Corrêa, Philippe Michelon, Bertrand Le Cun +2
Finding the clique of maximum cardinality in an arbitrary graph is an NP-Hard problem that has many applications, which has motivated studies to solve it exactly despite its diffic…