Showing 2018Show all
2 papers · 1 filter
cs.CG2018
Bundled Crossings Revisited
Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven +3
An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many suc…
cs.DM2018
Planar Steiner Orientation is NP-complete
Moritz Beck, Johannes Blum, Myroslav Kryven +2
Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edge…