4 citations · 6 across the 5 of their papers we have counts for
8 papers
Graph determination problem from knowledge of its subgraphs
Coralie Zens, Dominique Barth, Dimitri Watel +1
In the context of graph reconstruction studies, this paper addresses the problem defined as follows: given a sample of vertex-coloured graphs, each associated with a number, does t…
Maximal Line Digraphs
Quentin Japhet, Dimitri Watel, Dominique Barth +1
A line digraph is the digraph constructed from the digraph such that there is an arc in if the terminal node of in is the initia…
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…
The Maximum Matrix Contraction Problem
Dimitri Watel, Pierre-Louis Poirion
In this paper, we introduce the Maximum Matrix Contraction problem, where we aim to contract as much as possible a binary matrix in order to maximize its density. We study the comp…
A graph-database approach to assess the impact of demand-responsive services on public transit accessibility
Cathia Le Hasif, Andrea Araldo, Stefania Dumbrava +1
This paper proposes an approach to analyze the impact of multimodal Public Transit (PT), combining conventional fixed-route transit and Demand-Responsive Transit (DRT), on equality…
A new graph modelisation for molecule similarity
Stéfi Nouleho, Dominique Barth, Franck Quessette +3
In order to define the process of restrosynthesis of a new organic molecule, it is often necessary to be able to draw inspiration from that of a molecule similar to the target one…
Adaptive Network Flow with -Arc Destruction
Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion +1
When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with -Arc Destruction is known to be -hard for . We show that when a flow is allowed to be…