2 papers
cs.DS2020
Sorting an Array Using the Topological Sort of a Corresponding Comparison Graph
Balaram Behera
The quest for efficient sorting is ongoing, and we will explore a graph-based stable sorting strategy, in particular employing comparison graphs. We use the topological sort to map…
math.CO2020
FPT Algorithms for Finding Near-Cliques in -Closed Graphs
Balaram Behera, Edin Husić, Shweta Jain +2
Finding large cliques or cliques missing a few edges is a fundamental algorithmic task in the study of real-world graphs, with applications in community detection, pattern recognit…