3 papers
cs.DS2026
On the parameterized complexity of computing good edge-labelings
Davi de Andrade, Júlio Araújo, Laure Morelle +2
A good edge-labeling (gel for short) of a graph is a function such that, for any ordered pair of vertices of , there do not exist two dist…
cs.DS2025
Matching and Edge Cover in Temporal Graphs
Lapo Cioni, Riccardo Dondi, Andrea Marino +2
Temporal graphs are a special class of graphs for which a temporal component is added to edges, that is, each edge possesses a set of times at which it is available and can be trav…
cs.CC2025
Temporal Cycle Detection and Acyclic Temporization
Davi de Andrade, Júlio Araújo, Allen Ibiapina +3
In directed graphs, a cycle can be seen as a structure that allows its vertices to loop back to themselves, or as a structure that allows pairs of vertices to reach each other thro…