6 citations · 12 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017★ 1 cited
The Parameterized Complexity of Centrality Improvement in Networks
Clemens Hoffmann, Hendrik Molter, Manuel Sorge
The centrality of a vertex v in a network intuitively captures how important v is for communication in the network. The task of improving the centrality of a vertex has many applic…
cs.CC2017★ 1 cited
The Complexity of Routing with Few Collisions
Till Fluschnik, Marco Morik, Manuel Sorge
We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph with two distinct terminal verti…