4 citations · 6 across the 17 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
Breaking the hegemony of the triangle method in clique detection
Mirosław Kowaluk, Andrzej Lingas
We consider the fundamental problem of detecting/counting copies of a fixed pattern graph in a host graph. The recent progress on this problem has not included complete pattern gra…
cs.DS2021
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs
Andrzej Lingas, Mia Persson, Dzmitry Sledneu
A straightforward dynamic programming method for the single-source shortest paths problem (SSSP) in an edge-weighted directed acyclic graph (DAG) processes the vertices in a topolo…