3 papers
cs.CG2016
The Bundled Crossing Number
Md. Jawaherul Alam, Martin Fink, Sergey Pupyrev
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number…
cs.CG2014
Drawing Graphs within Restricted Area
Maximilian Aulbach, Martin Fink, Julian Schuhmann +1
We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform verte…
cs.DS2010
Maximum Betweenness Centrality: Approximability and Tractable Cases
Martin Fink, Joachim Spoerhase
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a -element node set that maximizes the probability of detecting communication…