-
Two-Connected Graphs with Given Diameter
The problem we study in this work is an extremal problem arising from graph theory : what is the minimum number of edges of a 2-connected graph satisfying diameter... -
Computing the Diameter of a Point Set
Given a finite set of points $\cal P$ in $\mathbb{R}^d$, the diameter of $\cal P$ is defined as the maximum distance between two points of $\cal P$. We propose a very... -
Fiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particu...
Let G be a graph. Its laplacian matrix L(G) is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been... -
Directed Virtual Path Layouts in ATM Networks
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical... -
Numerical Investigation of Diameter Effect on Heat Transfer of Supercritical ...
International audience -
Finite Element simulation of buckling-induced vein tortuosity and influence o...
International audience -
The use of terrestrial LiDAR technology in forest science: application fields...
International audience -
Cubic Cayley graphs with small diameter.
International audience -
Bounds for the minimum oriented diameter
Graphs and Algorithms -
Random Planar Lattices and Integrated SuperBrownian Excursion
Colloque avec actes et comité de lecture. internationale.
