4 citations · 8 across the 3 of their papers we have counts for
4 papers
Maximizing Minimum Cycle Bases Intersection
Dimitri Watel, Marc-Antoine Weisser, Dominique Barth +2
We address a specific case of the matroid intersection problem: given a set of graphs sharing the same set of vertices, select a minimum cycle basis for each graph to maximize the…
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…
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…
SLA Establishment with Guaranteed QoS in the Interdomain Network: A Stock Model
Dominique Barth, Boubkeur Boudaoud, Thierry Mautor
The new model that we present in this paper is introduced in the context of guaranteed QoS and resources management in the inter-domain routing framework. This model, called the st…