-
Constructing Incremental Sequences in Graphs
Given a weighted graph $G=(V,E,w)$, we investigate the problem of constructing a sequence of $n=|V|$ subsets of vertices $M_1,...,M_n$ (called groups) with small... -
Traffic Grooming on the Path
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most $1/C$ of the bandwidth of... -
Reaction Motifs in Metabolic Networks
The classic view of metabolism as a collection of metabolic pathways is being questioned with the currently available possibility of studying whole networks. Novel... -
The hierarchy of the cocoons of a graph and its application to image segmenta...
International audience -
Governance and Analysis of Business Processes Change Impact on Service Orient...
Most companies evolve in competitive markets by quickly adapting their business processes. Their performance depends on their capability to adopt continuous... -
A generic approach of spatial and temporal modelling : application to dynamic...
Sciences dealing with reality be it related to nature, society or life, use models. Some of these models describe the relations that exist between measurable... -
Exact and approximate algorithms for computing the hyperbolicity of large-sca...
Let G be a connected graph, and let d(a, b) denotes the shortest path distance between vertices a and b of G. The graph G is δ-hyperbolic if for any vertices a, b, c,... -
Graph-based inter-subject classification of local fMRI patterns
International audience -
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
