Morten Stöckel

activity

20122017

most citedFinding Even Cycles Faster via Capped k-Walks

2 citations · 6 across the 9 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DS2017★ 1 cited

Constructing Light Spanners Deterministically in Near-Linear Time

Stephen Alstrup, Søren Dahlgaard, Arnold Filtser +2

Graph spanners are well-studied and widely used both in theory and practice. In a recent breakthrough, Chechik and Wulff-Nilsen [CW18] improved the state-of-the-art for light spann…

cs.DS2017

New Subquadratic Approximation Algorithms for the Girth

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel

We consider the problem of approximating the girth, $g$ , of an unweighted and undirected graph $G = (V, E)$ with $n$ nodes and $m$ edges. A seminal result of Itai and Rodeh [SICOMP'78…

cs.DS2017★ 2 cited

Finding Even Cycles Faster via Capped k-Walks

Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel

In this paper, we consider the problem of finding a cycle of length $2 k$ (a $C_{2 k}$ ) in an undirected graph $G$ with $n$ nodes and $m$ edges for constant $k \geq 2$ . A classic result…