activity
20172022
most citedQuery-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

23 citations · 23 across the 4 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

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…