Showing cs.DSShow all
3 papers · 1 filter
cs.DS2021
Finding all minimum cost flows and a faster algorithm for the K best flow problem
David Könen, Daniel R. Schmidt, Christiane Spisla
This paper addresses the problem of determining all optimal integer solutions of a linear integer network flow problem, which we call the all optimal integer flow (AOF) problem. We…
cs.DS2018
A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width
Michael Jünger, Petra Mutzel, Christiane Spisla
We consider the coordinate assignment phase of the well known Sugiyama framework for drawing directed graphs in a hierarchical style. The extensive literature in this area has give…
cs.DS2017
Orthogonal Compaction Using Additional Bends
Michael Jünger, Petra Mutzel, Christiane Spisla
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We…