3 papers
cs.DS2025
On the Complexity of the Ordered Covering Problem in Distance Geometry
Michael Souza, Júlio Araújo, John Kesley Costa +1
The Ordered Covering Problem (OCP) arises in the context of the Discretizable Molecular Distance Geometry Problem (DMDGP), where the ordering of pruning edges significantly impacts…
math.CO2025
Backbone colouring of chordal graphs
Júlio Araújo, Nicolas Nisse, Lucas Picasarri-Arrieta
A proper -colouring of a graph is a function such that for every edge . The chromatic number is the mini…
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…