David Coudert
Research Subjects
David Coudert has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Brigitte Jaumard
Department of Computer Science and Software Engineering, Concordia University, Montreal, QC, Canada
4 shared publications - Nicolas Nisse
Université Côte D’Azur, Inria, CNRS, I3S
4 shared publications Jean-Claude Bermond
3 shared publications- Emanuele Natale
CNRS, COATI, I3S, Université Côte d'Azur, Sophia Antipolis, France
2 shared publications - Emilio Cruciani
Paris-Lodron University of Salzburg Salzburg Austria
2 shared publications Guillaume Ducoffe
University of Bucharest
2 shared publications
Latest Publications
Maximum Number of Requests on a Path With a Given Grooming Factor
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application and by its interest in computing lower bounds on the cutwidth of a graph. We are given a directed path on vertices and a positive integer capacity (grooming factor). The MARPG problem consists of determining a maximum‐cardinality set of pairwise‐different simple sub‐dipaths (requests) subject to the constraint that each arc is contained in at most of these dipaths. This problem can be solved in polynomial time using a reduction to a minimum cost flow problem in a directed graph. In this paper, we fully characterize the set of requests of an optimal solution to the MARPG problem and show how to compute in constant time its cardinality . Furthermore, we fix an unfortunate error in the formula of that appears in the preliminary conference version of this paper. We first show that the solution obtained by greedily taking the requests of the smallest size (length) is not always optimal, disproving a claim from previous work. We then characterize optimal solutions and show that they are obtained by a different greedy algorithm based on a weight order. We characterize the so‐called “anomalies” which roughly correspond to the set of requests belonging to an optimal solution but not to the smallest‐size greedy algorithm. Then, we establish a formula returning in constant time the value of the number of anomalies and therefore the exact cardinality of of an optimal solution to the MARPG problem. Finally, we establish upper bounds on the number of anomalies, in particular, the general one that the number of anomalies is at most . These bounds have been used to get new lower bounds on the cutwidth of a graph.
Maximum Number of Requests on a Path With a Given Grooming Factor
We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application and by its interest in computing lower bounds on the cutwidth of a graph. We are given a directed path on vertices and a positive integer capacity (grooming factor). The MARPG problem consists of determining a maximum‐cardinality set of pairwise‐different simple sub‐dipaths (requests) subject to the constraint that each arc is contained in at most of these dipaths. This problem can be solved in polynomial time using a reduction to a minimum cost flow problem in a directed graph. In this paper, we fully characterize the set of requests of an optimal solution to the MARPG problem and show how to compute in constant time its cardinality . Furthermore, we fix an unfortunate error in the formula of that appears in the preliminary conference version of this paper. We first show that the solution obtained by greedily taking the requests of the smallest size (length) is not always optimal, disproving a claim from previous work. We then characterize optimal solutions and show that they are obtained by a different greedy algorithm based on a weight order. We characterize the so‐called “anomalies” which roughly correspond to the set of requests belonging to an optimal solution but not to the smallest‐size greedy algorithm. Then, we establish a formula returning in constant time the value of the number of anomalies and therefore the exact cardinality of of an optimal solution to the MARPG problem. Finally, we establish upper bounds on the number of anomalies, in particular, the general one that the number of anomalies is at most . These bounds have been used to get new lower bounds on the cutwidth of a graph.
- 22 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 182
New lower bounds on the cutwidth of graphs
- 22 May 2025
- Published by Elsevier in Computers & Operations Research
- Vol. 182
New lower bounds on the cutwidth of graphs
- Open Access
- 17 March 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1039
k-shortest simple paths in bounded treewidth graphs
- 17 March 2025
- Published by Elsevier in Theoretical Computer Science
- Vol. 1039
Open Accessk-shortest simple paths in bounded treewidth graphs
- Open Access
- 8 July 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. 26:2 (Graph Theo)
Leanness Computation: Small Values and Special Graph Classes
Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k. The leanness of G is the maximum diameter of a slice. This metric graph invariant has been studied under different names, such as "interval thinness" and "fellow traveler property". Graphs with leanness equal to 0, a.k.a. geodetic graphs, also have received special attention in Graph Theory. The practical computation of leanness in real-life complex networks has been studied recently (Mohammed et al., COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely: deciding whether the leanness of a graph G is at most some small value ℓ; and computing the leanness on specific graph classes. We obtain improved algorithms in some cases, and time complexity lower bounds under plausible hypotheses.
- 8 July 2024
- Published by Centre pour la Communication Scientifique Directe (CCSD) in Discrete Mathematics & Theoretical Computer Science
- Vol. 26:2 (Graph Theo)
Open AccessLeanness Computation: Small Values and Special Graph Classes
Let u and v be vertices in a connected graph G = (V, E). For any integer k such that 0 ≤ k ≤ dG (u, v), the k-slice Sk (u, v) contains all vertices x on a shortest uv-path such that dG (u, x) = k. The leanness of G is the maximum diameter of a slice. This metric graph invariant has been studied under different names, such as "interval thinness" and "fellow traveler property". Graphs with leanness equal to 0, a.k.a. geodetic graphs, also have received special attention in Graph Theory. The practical computation of leanness in real-life complex networks has been studied recently (Mohammed et al., COMPLEX NETWORKS'21). In this paper, we give a finer-grained complexity analysis of two related problems, namely: deciding whether the leanness of a graph G is at most some small value ℓ; and computing the leanness on specific graph classes. We obtain improved algorithms in some cases, and time complexity lower bounds under plausible hypotheses.
- Open Access
- 21 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 28, 1-23
Finding the k Shortest Simple Paths: Time and Space Trade-offs
The k shortest simple path problem ( k SSP) asks to compute a set of top- k shortest simple paths from a source to a sink in a digraph. Yen (1971) proposed an algorithm with the best-known polynomial time complexity for this problem. Since then, the problem has been widely studied from an algorithm engineering perspective. The most noticeable proposals are the node-classification (NC) algorithm (Feng, 2014) and the sidetracks-based (SB) algorithm (Kurz, Mutzel, 2016). The latest offers the best running time at the price of a significant memory consumption. We first show how to speed up the SB algorithm using dynamic updates of shortest path trees resulting in a faster algorithm (SB*) with the same memory consumption. We then propose the parsimonious SB (PSB) algorithm that significantly reduces the memory consumption of SB at the cost of a small increase of the running time. Furthermore, we propose the postponed node-classification (PNC) algorithm that combines the best of the NC and the SB algorithms. It offers a significant speed up compared to the SB algorithm while using the same amount of memory as the NC algorithm. Our experimental results on complex networks show that all the considered algorithms have low memory consumption, and that the PSB algorithm is the fastest. On road networks, the relative performances of the algorithms depend on the number k of requested paths. Indeed, when the number k of requested paths is small (i.e., k ≤ 20 in our experiments), the SB* algorithm is the fastest among the considered algorithms, but it suffers from a large memory consumption and it offers very bad performances on some queries. When the number of requested paths is large (i.e., larger than 20 according to our experiments), the PNC algorithm is the fastest among the considered algorithms on road networks and it has a low memory footprint. The PNC algorithm is therefore a better choice on road networks.
- 21 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 28, 1-23
Open AccessFinding the k Shortest Simple Paths: Time and Space Trade-offs
The k shortest simple path problem ( k SSP) asks to compute a set of top- k shortest simple paths from a source to a sink in a digraph. Yen (1971) proposed an algorithm with the best-known polynomial time complexity for this problem. Since then, the problem has been widely studied from an algorithm engineering perspective. The most noticeable proposals are the node-classification (NC) algorithm (Feng, 2014) and the sidetracks-based (SB) algorithm (Kurz, Mutzel, 2016). The latest offers the best running time at the price of a significant memory consumption. We first show how to speed up the SB algorithm using dynamic updates of shortest path trees resulting in a faster algorithm (SB*) with the same memory consumption. We then propose the parsimonious SB (PSB) algorithm that significantly reduces the memory consumption of SB at the cost of a small increase of the running time. Furthermore, we propose the postponed node-classification (PNC) algorithm that combines the best of the NC and the SB algorithms. It offers a significant speed up compared to the SB algorithm while using the same amount of memory as the NC algorithm. Our experimental results on complex networks show that all the considered algorithms have low memory consumption, and that the PSB algorithm is the fastest. On road networks, the relative performances of the algorithms depend on the number k of requested paths. Indeed, when the number k of requested paths is small (i.e., k ≤ 20 in our experiments), the SB* algorithm is the fastest among the considered algorithms, but it suffers from a large memory consumption and it offers very bad performances on some queries. When the number of requested paths is large (i.e., larger than 20 according to our experiments), the PNC algorithm is the fastest among the considered algorithms on road networks and it has a low memory footprint. The PNC algorithm is therefore a better choice on road networks.
- Open Access
- 13 December 2022
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 27, 1-29
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
Hyperbolicity is a graph parameter that indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, computing the hyperbolicity of a graph remains challenging. Indeed, the best known algorithm has time complexity O(n 3.69 ) , which is prohibitive for large graphs, and the most efficient algorithms in practice have space complexity O(n 2 ) . Thus, time as well as space are bottlenecks for computing the hyperbolicity. In this article, we design a tool for enumerating all far-apart pairs of a graph by decreasing distances. A node pair (u, v) of a graph is far-apart if both v is a leaf of all shortest-path trees rooted at u and u is a leaf of all shortest-path trees rooted at v . This notion was previously used to drastically reduce the computation time for hyperbolicity in practice. However, it required the computation of the distance matrix to sort all pairs of nodes by decreasing distance, which requires an infeasible amount of memory already for medium-sized graphs. We present a new data structure that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several large graphs that were far out of reach using previous algorithms. For some instances, we reduce the memory consumption by at least two orders of magnitude. Furthermore, we show that for many graphs, only a very small fraction of far-apart pairs has to be considered for the hyperbolicity computation, explaining this drastic reduction of memory. As iterating over far-apart pairs in decreasing order without storing them explicitly is a very general tool, we believe that our approach might also be relevant to other problems.
- 13 December 2022
- Published by Association for Computing Machinery (ACM) in ACM Journal of Experimental Algorithmics
- Vol. 27, 1-29
Open AccessEnumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
Hyperbolicity is a graph parameter that indicates how much the shortest-path distance metric of a graph deviates from a tree metric. It is used in various fields such as networking, security, and bioinformatics for the classification of complex networks, the design of routing schemes, and the analysis of graph algorithms. Despite recent progress, computing the hyperbolicity of a graph remains challenging. Indeed, the best known algorithm has time complexity O(n 3.69 ) , which is prohibitive for large graphs, and the most efficient algorithms in practice have space complexity O(n 2 ) . Thus, time as well as space are bottlenecks for computing the hyperbolicity. In this article, we design a tool for enumerating all far-apart pairs of a graph by decreasing distances. A node pair (u, v) of a graph is far-apart if both v is a leaf of all shortest-path trees rooted at u and u is a leaf of all shortest-path trees rooted at v . This notion was previously used to drastically reduce the computation time for hyperbolicity in practice. However, it required the computation of the distance matrix to sort all pairs of nodes by decreasing distance, which requires an infeasible amount of memory already for medium-sized graphs. We present a new data structure that avoids this memory bottleneck in practice and for the first time enables computing the hyperbolicity of several large graphs that were far out of reach using previous algorithms. For some instances, we reduce the memory consumption by at least two orders of magnitude. Furthermore, we show that for many graphs, only a very small fraction of far-apart pairs has to be considered for the hyperbolicity computation, explaining this drastic reduction of memory. As iterating over far-apart pairs in decreasing order without storing them explicitly is a very general tool, we believe that our approach might also be relevant to other problems.
- Open Access
- 28 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Minimum Disturbance Rerouting to Optimize Bandwidth Usage
Dynamic traffic leads to bandwidth fragmentation, which drastically reduces network performance, resulting in increased blocking rate and reduced bandwidth usage.When rerouting traffic flows at Layer 3 of an optical network, network operators are interested in minimizing the disturbances in order to satisfy their Service Level Agreements. Therefore, they turn to the Make-Before-Break (MBB) paradigm.In this paper, we revisit MBB rerouting with the objective of identifying the reroute sequence planning that minimizes the number of reroutes in order to minimize the resource usage.We propose a Dantzig-Wolfe decomposition mathematical model to solve this complex rerouting problem. We instigate how multiple or parallel rerouting reduces the overall minimum number of rerouting events (shortest makespan), and achieve the best resource usage. Numerical results bring interesting insights on that question and show a computational time reduction by about one order of magnitude over the state of the art.
- 28 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessMinimum Disturbance Rerouting to Optimize Bandwidth Usage
Dynamic traffic leads to bandwidth fragmentation, which drastically reduces network performance, resulting in increased blocking rate and reduced bandwidth usage.When rerouting traffic flows at Layer 3 of an optical network, network operators are interested in minimizing the disturbances in order to satisfy their Service Level Agreements. Therefore, they turn to the Make-Before-Break (MBB) paradigm.In this paper, we revisit MBB rerouting with the objective of identifying the reroute sequence planning that minimizes the number of reroutes in order to minimize the resource usage.We propose a Dantzig-Wolfe decomposition mathematical model to solve this complex rerouting problem. We instigate how multiple or parallel rerouting reduces the overall minimum number of rerouting events (shortest makespan), and achieve the best resource usage. Numerical results bring interesting insights on that question and show a computational time reduction by about one order of magnitude over the state of the art.
- Open Access
- 28 June 2021
- Published by MIT Press in Network Neuroscience
- Vol. 5 (3) , 1-23
Network alignment and similarity reveal atlas-based topological differences in structural connectomes
The interactions between different brain regions can be modeled as a graph, called connectome, whose nodes correspond to parcels from a predefined brain atlas. The edges of the graph encode the strength of the axonal connectivity between regions of the atlas that can be estimated via diffusion magnetic resonance imaging (MRI) tractography. Herein, we aim to provide a novel perspective on the problem of choosing a suitable atlas for structural connectivity studies by assessing how robustly an atlas captures the network topology across different subjects in a homogeneous cohort. We measure this robustness by assessing the alignability of the connectomes, namely the possibility to retrieve graph matchings that provide highly similar graphs. We introduce two novel concepts. First, the graph Jaccard index (GJI), a graph similarity measure based on the well-established Jaccard index between sets; the GJI exhibits natural mathematical properties that are not satisfied by previous approaches. Second, we devise WL-align, a new technique for aligning connectomes obtained by adapting the Weisfeiler-Leman (WL) graph-isomorphism test. We validated the GJI and WL-align on data from the Human Connectome Project database, inferring a strategy for choosing a suitable parcellation for structural connectivity studies. Code and data are publicly available.
- 28 June 2021
- Published by MIT Press in Network Neuroscience
- Vol. 5 (3) , 1-23
Open AccessNetwork alignment and similarity reveal atlas-based topological differences in structural connectomes
The interactions between different brain regions can be modeled as a graph, called connectome, whose nodes correspond to parcels from a predefined brain atlas. The edges of the graph encode the strength of the axonal connectivity between regions of the atlas that can be estimated via diffusion magnetic resonance imaging (MRI) tractography. Herein, we aim to provide a novel perspective on the problem of choosing a suitable atlas for structural connectivity studies by assessing how robustly an atlas captures the network topology across different subjects in a homogeneous cohort. We measure this robustness by assessing the alignability of the connectomes, namely the possibility to retrieve graph matchings that provide highly similar graphs. We introduce two novel concepts. First, the graph Jaccard index (GJI), a graph similarity measure based on the well-established Jaccard index between sets; the GJI exhibits natural mathematical properties that are not satisfied by previous approaches. Second, we devise WL-align, a new technique for aligning connectomes obtained by adapting the Weisfeiler-Leman (WL) graph-isomorphism test. We validated the GJI and WL-align on data from the Human Connectome Project database, inferring a strategy for choosing a suitable parcellation for structural connectivity studies. Code and data are publicly available.
- 22 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 29 (5) , 1910-1921
Efficient Make-Before-Break Layer 2 Reoptimization
Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
- 22 June 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 29 (5) , 1910-1921
Efficient Make-Before-Break Layer 2 Reoptimization
Optical multilayer optimization periodically reorganizes layer 0-1-2 network elements to handle both existing and dynamic traffic requirements in the most efficient manner. This delays the need for adding new resources in order to cope with the evolution of the traffic, thus saving CAPEX. The focus of this paper is on Layer 2, i.e., on capacity reoptimization at the optical transport network (OTN) layer when routes (e.g., LSPs in MPLS networks) are making unnecessarily long detours to evade congestion. Reconfiguration into optimized routes can be achieved by re-defining the routes, one at a time, so that they use the vacant resources generated by the disappearance of services using part of a path that transits the congested section. To maintain the Quality of Service, it is desirable to operate under a Make-Before-Break (MBB) paradigm, with the minimum number of reroutings. The challenge is to determine the best rerouting order while minimizing the bandwidth requirement. We propose an exact and scalable optimization model for computing a minimum bandwidth rerouting scheme subject to MBB in the OTN layer of an optical network. Numerical results show that we can successfully apply it on networks with up to 30 nodes, a very significant improvement with respect to the state of the art. We also provide some reoptimization analysis in terms of the bandwidth requirement vs. the number of reroutings.
- Open Access
Network alignment and similarity reveal atlas-based topological differences in structural connectomes
The interactions between different brain regions can be modeled as a graph, called connectome, whose nodes correspond to parcels from a predefined brain atlas. The edges of the graph encode the strength of the axonal connectivity between regions of the atlas which can be estimated via diffusion Magnetic Resonance Imaging (MRI) tractography. Herein, we aim at providing a novel perspective on the problem of choosing a suitable atlas for structural connectivity studies by assessing how robustly an atlas captures the network topology across different subjects in a homogeneous cohort. We measure this robustness by assessing the alignability of the connectomes, namely the possibility to retrieve graph matchings that provide highly similar graphs. We introduce two novel concepts. First, the graph Jaccard index (GJI), a graph similarity measure based on the well-established Jaccard index between sets; the GJI exhibits natural mathematical properties that are not satisfied by previous approaches. Second, we devise WL-align, a new technique for aligning connectomes obtained by adapting the Weisfeiler-Lehman (WL) graph-isomorphism test. We validated the GJI and WL-align on data from the Human Connectome Project database, inferring a strategy for choosing a suitable parcellation for structural connectivity studies. Code and data are publicly available. AUTHOR SUMMARY An important part of our current understanding of the structure of the human brain relies on the concept of brain network, which is obtained by looking at how different brain regions are connected with each other. In this paper we present a strategy for choosing a suitable parcellation of the brain for structural connectivity studies by making use of the concepts of network alignment and similarity. To do so, we design a novel similarity measure between weighted networks called graph Jaccard index, and a new network alignment technique called WL-align. By assessing the possibility to retrieve graph matchings that provide highly similar graphs, we show that morphology- and structure-based atlases define brain networks which are more topologically robust across a wide range of resolutions.
Open AccessNetwork alignment and similarity reveal atlas-based topological differences in structural connectomes
The interactions between different brain regions can be modeled as a graph, called connectome, whose nodes correspond to parcels from a predefined brain atlas. The edges of the graph encode the strength of the axonal connectivity between regions of the atlas which can be estimated via diffusion Magnetic Resonance Imaging (MRI) tractography. Herein, we aim at providing a novel perspective on the problem of choosing a suitable atlas for structural connectivity studies by assessing how robustly an atlas captures the network topology across different subjects in a homogeneous cohort. We measure this robustness by assessing the alignability of the connectomes, namely the possibility to retrieve graph matchings that provide highly similar graphs. We introduce two novel concepts. First, the graph Jaccard index (GJI), a graph similarity measure based on the well-established Jaccard index between sets; the GJI exhibits natural mathematical properties that are not satisfied by previous approaches. Second, we devise WL-align, a new technique for aligning connectomes obtained by adapting the Weisfeiler-Lehman (WL) graph-isomorphism test. We validated the GJI and WL-align on data from the Human Connectome Project database, inferring a strategy for choosing a suitable parcellation for structural connectivity studies. Code and data are publicly available. AUTHOR SUMMARY An important part of our current understanding of the structure of the human brain relies on the concept of brain network, which is obtained by looking at how different brain regions are connected with each other. In this paper we present a strategy for choosing a suitable parcellation of the brain for structural connectivity studies by making use of the concepts of network alignment and similarity. To do so, we design a novel similarity measure between weighted networks called graph Jaccard index, and a new network alignment technique called WL-align. By assessing the possibility to retrieve graph matchings that provide highly similar graphs, we show that morphology- and structure-based atlases define brain networks which are more topologically robust across a wide range of resolutions.