89 citations · 138 across the 17 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018★ 1 cited
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
Andreas Björklund, Thore Husfeldt
Given an undirected graph and two disjoint vertex pairs and , the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disj…
cs.DS2018★ 9 cited
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth
Karl Bringmann, Thore Husfeldt, Måns Magnusson
We show that the eccentricities, diameter, radius, and Wiener index of an undirected -vertex graph with nonnegative edge lengths can be computed in time $O(n\cdot \binom{k+\lcei…
cs.DS2018
Extensor-Coding
Cornelius Brand, Holger Dell, Thore Husfeldt
We devise an algorithm that approximately computes the number of paths of length in a given directed graph with vertices up to a multiplicative error of …