Søren Dahlgaard

Learn More
We show that there exists a graph G with O(n) nodes, where any forest of n nodes is a node-induced subgraph of G. Furthermore, for constant arboricity k, the result implies the existence of a graph with O(nk) nodes that contains all n-node graphs as node-induced subgraphs, matching a &#x03A9;(n<sup>k</sup>) lower bound. The lower bound and previously best(More)
Finding important nodes in a graph and measuring their importance is a fundamental problem in the analysis of social networks, transportation networks, biological systems, etc. Among the most popular such metrics of importance are graph centrality, betweenness centrality (BC), and reach centrality (RC). These measures are also very related to classic(More)
The dynamic shortest paths problem on planar graphs asks us to preprocess a planar graph G such that we may support insertions and deletions of edges in G as well as distance queries between any two nodes u, v subject to the constraint that the graph remains planar at all times. This problem has been extensively studied in both the theory and experimental(More)
Conditional lower bounds for dynamic graph problems has received a great deal of attention in recent years. While many results are now known for the fully-dynamic case and such bounds often imply worst-case bounds for the partially dynamic setting, it seems much more difficult to prove amortized bounds for incremental and decremental algorithms. In this(More)
A distance labeling scheme labels the n nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A D-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least D from each(More)
A distance labeling scheme labels the n nodes of a graph with binary strings such that, given the labels of any two nodes, one can determine the distance in the graph between the two nodes by looking only at the labels. A D-preserving distance labeling scheme only returns precise distances between pairs of nodes that are at distance at least D from each(More)
In this paper we analyze a hash function for k-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin. This generic method was originally introduced by Flajolet and Martin [FOCS'83] in order to save a factor &#x03A9;(k) of time per element over k independent samples when estimating the(More)
A random hash function h is ε-minwise if for any set S, |S| " n, and element x P S, Prrhpxq " min hpSqs " p1 ˘ εq{n. Minwise hash functions with low bias ε have widespread applications within similarity estimation. Hashing from a universe rus, the twisted tabulation hashing of Pˇatraşcu and Thorup [SODA'13] makes c " Op1q lookups in tables of size u 1{c.(More)
Finding cycles in graphs is a fundamental problem in algorithmic graph theory. In this paper, we consider the problem of finding and reporting a cycle of length 2<i>k</i> in an undirected graph <i>G</i> with <i>n</i> nodes and <i>m</i> edges for constant <i>k</i>&#226;‰¥ 2. A classic result by Bondy and Simonovits [J. Combinatorial Theory, 1974] implies(More)
For a given a graph, a distance oracle is a data structure that answers distance queries between pairs of vertices. We introduce an Opn 5{3 q-space distance oracle which answers exact distance queries in Oplog nq time for n-vertex planar edge-weighted digraphs. All previous distance oracles for planar graphs with truly subquadratic space (i.e., space Opn(More)