Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Finding Small Complete Subgraphs Efficiently
Ke Chen, Adrian Dumitrescu, Andrzej Lingas
(I) We revisit the algorithmic problem of finding all triangles in a graph with vertices and edges. According to a result of Chiba and Nishizeki (1985), this task…
cs.DS2014
Selection Algorithms with Small Groups
Ke Chen, Adrian Dumitrescu
We revisit the selection problem, namely that of computing the th order statistic of given elements, in particular the classic deterministic algorithm by grouping and partit…