- Ben-Gurion University of the NegevIL1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Clermont UniversitéFR1 paper
- Indian Statistical InstituteIN1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Technical University of MunichDE1 paper
- Thales (Portugal)PT1 paper
- Université Clermont AuvergneFR1 paper
- University of Clermont Auvergne1 paper
- University of LeedsGB1 paper
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Algorithms and complexity for geodetic sets on interval and chordal graphs
Dibyayan Chakraborty, Sandip Das, Florent Foucaud +2
We study the computational complexity of finding the geodetic number of a graph on chordal graphs and interval graphs. A set of vertices of a graph is a \textit{geodetic se…
cs.DS2026
Optimal Smoothed Analysis of the Simplex Method
Eleon Bach, Sophie Huiberts
Smoothed analysis is a method for analyzing the performance of algorithms, used especially for those algorithms whose running time in practice is significantly better than what can…