
Enumeration of FarApart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
Hyperbolicity is a graph parameter which indicates how much the shortest...
read it

On Computing Pareto Optimal Paths in Weighted TimeDependent Networks
A weighted pointavailability timedependent network is a list of tempor...
read it

A Comparative Study of Neural Network Compression
There has recently been an increasing desire to evaluate neural networks...
read it

Fast Diameter Computation within Split Graphs
When can we compute the diameter of a graph in quasi linear time? We add...
read it

Diameter computation on Hminor free graphs and graphs of bounded (distance) VCdimension
We propose to study unweighted graphs of constant distance VCdimension ...
read it

Fast Public Transit Routing with Unrestricted Walking through Hub Labeling
We propose a novel technique for answering routing queries in public tra...
read it

Hardness of exact distance queries in sparse graphs through hub labeling
A distance labeling scheme is an assignment of bitlabels to the vertice...
read it

Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets
The problem of detecting loops in a forwarding network is known to be NP...
read it

Exact Distance Oracles Using Hopsets
For fixed h ≥ 2, we consider the task of adding to a graph G a set of we...
read it

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates
We introduce notions of certificates allowing to bound eccentricities in...
read it
Laurent Viennot
is this you? claim profile