10 citations · 20 across the 5 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 10 cited
Certifying 3-Edge-Connectivity
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
We present a certifying algorithm that tests graphs for 3-edge-connectivity; the algorithm works in linear time. If the input graph is not 3-edge-connected, the algorithm returns a…
cs.SI2012★ 1 cited
Remarks on Category-Based Routing in Social Networks
Karl Bringmann, Kurt Mehlhorn, Adrian Neumann
It is well known that individuals can route messages on short paths through social networks, given only simple information about the target and using only local knowledge about the…