-
Propagation of a position in a connected network
Positioning systems have undeniably progressed. Currently, in an outdoor environment, the accuracy reaches a few centimetres under certain conditions: open space,... -
Path planning using intervals and graphs
International audience -
ASMATRA: Rankin g ASs Providing Transit Service to Malware Hosters
International audience -
Shared-Neighbours methods for visual content structuring and mining
This thesis investigates new clustering paradigms and algorithms based on the principle of the shared nearest-neighbors (SNN. As most other graph-based clustering... -
On the genericity of pseudo-Anosov braids I: rigid braids
International audience -
On the number of components of a graph
International audience -
A unified approach to structural limits, and limits of graphs with bounded tr...
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of... -
Efficient parallel dynamic load balancing for very large numerical problems
This thesis concerns efficient parallel dynamic load balancing for large scale numerical problems. First, we present a state of the art of the algorithms used to solve... -
Graph-Based Approaches to Clustering Network-Constrained Trajectory Data
International audience -
Shared memory parallel algorithms in Scotch 6
International audience -
How to age well a 20 y.o. Scotch
National audience -
Clique Number and Ball Containment Number of Unit Ball Graphs
This dataset has no description
-
A Note on Finding all Homogeneous Set Sandwiches
A homogeneous set is a set of vertices H of a graph G=(V,E) such that each vertex of V\H is either adjacent to all vertices of H or none of them. A graph Gs=(V,Es) is... -
A Simple Paradigm for Graph Recognition : Application to Cographs and Distanc...
International audience -
Eco-Driving in Urban Traffic Networks using Traffic Signal Information
International audience -
Modeling Limits in Hereditary Classes: Reduction and Application to Trees
Limits of graphs were initiated recently in the two extreme contexts of dense and bounded degree graphs. This led to elegant limiting structures called graphons and... -
Growth of balls in the universal cover of graphs and surfaces
This thesis deals with global Riemannian geometry without curvature assumptions and its link to topology, we focus on the maximal volume of balls of fixed radius in...
