Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Beer Path Problems in Temporal Graphs
Andrea D'Ascenzo, Giuseppe F. Italiano, Sotiris Kanellopoulos +3
Computing paths in graph structures is a fundamental operation in a wide range of applications, from transportation networks to data analysis. The beer path problem, which captures…
cs.DS2023
Adding a Tail in Classes of Perfect Graphs
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
Consider a graph which belongs to a graph class . We are interested in connecting a node to by a single edge where ; we call su…
cs.DS2023
Adding an Edge in a -sparse Graph
Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios
For a graph family~, the minimum -completion problem asks for the minimum number of non-edges to be added to a given graph~ so that the resulting graph belon…