Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
Ali Dasdan
The problem of finding the longest simple cycle in a directed graph is NP-hard, with critical applications in computational biology, scheduling, and network analysis. Existing appr…
cs.DS2025
The Kernighan-Lin Search Algorithm
Ali Dasdan
The traveling salesman problem (TSP) and the graph partitioning problem (GPP) are two important combinatorial optimization problems with many applications. Due to the NP-hardness o…