21 citations · 44 across the 25 of their papers we have counts for
Showing 2018 · cs.DSShow all
2 papers · 2 filters
cs.DS2018★ 1 cited
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
Thomas Bläsius, Cedric Freiberger, Tobias Friedrich +3
A common way to accelerate shortest path algorithms on graphs is the use of a bidirectional search, which simultaneously explores the graph from the start and the destination. It h…
cs.DS2018
Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling
Thomas Bläsius, Tobias Friedrich, Julius Lischeid +2
The transversal hypergraph problem is the task of enumerating the minimal hitting sets of a hypergraph. It is a long-standing open question whether this can be done in output-polyn…