3 papers
cs.DS2026
Efficient generation of expected-degree graphs via edge-arrivals
Gianlorenzo D'Angelo, Riccardo Michielan
We study the efficient generation of random graphs with a prescribed expected degree sequence, focusing on rank-1 inhomogeneous models in which vertices are assigned weights and ed…
cs.DS2026
Optimizing Distances for Multi-Broadcast in Temporal Graphs
Daniele Carnevale, Gianlorenzo D'Angelo
Temporal graphs represent networks in which connections change over time, with edges available only at specific moments. Motivated by applications in logistics, multi-agent informa…
cs.DS2025
Approximating Optimal Labelings for Temporal Connectivity
Daniele Carnevale, Gianlorenzo D'Angelo, Martin Olsen
In a temporal graph the edge set dynamically changes over time according to a set of time-labels associated with each edge that indicates at which time-steps the edge is available.…