No. Title Author Year
1 Isometric Embeddings in Trees and Their Use in Distance Problems Ducoffe, Guillaume 2021
2 Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width Ducoffe, Guillaume 2021
3 On Computing the Average Distance for Some Chordal-Like Graphs Ducoffe, Guillaume 2021
4 Optimal Centrality Computations Within Bounded Clique-Width Graphs Ducoffe, Guillaume 2021
5 Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs Ducoffe, Guillaume 2019
6 A New Application of Orthogonal Range Searching for Computing Giant Graph Diameters Ducoffe, Guillaume 2018
7 Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs Chalopin, Jérémie et al. 2018
8 How long does it take for all users in a social network to choose their communities? Bermond, Jean-Claude et al. 2018
9 The b-Matching Problem in Distance-Hereditary Graphs and Beyond Ducoffe, Guillaume et al. 2018
10 The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes Ducoffe, Guillaume et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 10

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI