23 citations · 23 across the 3 of their papers we have counts for
3 papers
cs.DB2021★ 23 cited
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
Ye Wang, Qing Wang, Henning Koehler +1
Computing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make f…
cs.DM2019
A characterization of maximal 2-dimensional subgraphs of transitive graphs
Henning Koehler
A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allo…
cs.DM2017
Modular decomposition of transitive graphs and transitively orienting their complements
Henning Koehler
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ signi…