SOFTWARE

Source Code of Implemented Algorithms and Experimental Results

• Loukas Georgiadis, Evangelos Kosinas, and Daniel Tsokaktsis. 2-Fault-Tolerant Strong Connectivity Oracles. In ALENEX 2024.

  • Source code: https://github.com/dtsok/2-FT-SC-O 

• Dionysios Kefallinos, Loukas Georgiadis, Anna Mpanti, and Stavros Nikolopoulos. An Experimental Study of Algorithms for Packing Arborescences. In SEA 2022.

  • Source code: https://github.com/sakiskef/PackingArborescencesAlgorithms 

• Loukas Georgiadis, Giuseppe F. Italiano, and Evangelos Kosinas. Computing the 4-Edge-Connected Components of a Graph: An Experimental Study. In ESA 2022.

  • Source code: https://github.com/4eComponentsALGO/files  

• Loukas Georgiadis, Konstantinos Giannis, Giuseppe Italiano, and Evangelos Kosinas. Computing Vertex-Edge Cut-Pairs and 2-Edge Cuts in Practice. In SEA 2021.

  • Source code: https://github.com/KoGi89/VECuts 

• Loukas Georgiadis, Dionysiοs Kefallinos, Nikos Parotsidis, and Luigi Laura. An Experimental Study of Algorithms for Computing the Edge Connectivity of a Directed Graph. In ALENEX 2021. 

  • Source code: https://github.com/sakiskef/EdgeConnectivityAlgorithms