- AutorIn
- Tobias Post
- Christina Gillmann
- Thomas Wischgoll
- Bernd Hamann
- Hans Hagen
- Titel
- Visual Analytics of Cascaded Bottlenecks in Planar Flow Networks
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:15-qucosa2-328032
- Quellenangabe
- LEVIA’18
Herausgeber: Jänicke, Stefan, Hotz, Ingrid, Liu, Shixia
Erscheinungsjahr: 2018 - Erstveröffentlichung
- 2018
- Abstract (EN)
- Finding bottlenecks and eliminating them to increase the overall flow of a network often appears in real world applications, such as production planning, factory layout, flow related physical approaches, and even cyber security. In many cases, several edges can form a bottleneck (cascaded bottlenecks). This work presents a visual analytics methodology to analyze these cascaded bottlenecks. The methodology consists of multiple steps: identification of bottlenecks, identification of potential improvements, communication of bottlenecks, interactive adaption of bottlenecks, and a feedback loop that allows users to adapt flow networks and their resulting bottlenecks until they are satisfied with the flow network configuration. To achieve this, the definition of a minimal cut is extended to identify network edges that form a (cascaded) bottleneck. To show the effectiveness of the presented approach, we applied the methodology to two flow network setups and show how the overall flow of these networks can be improved.
- Freie Schlagwörter (EN)
- Visual Analysis, Bottleneck Visualization, Flow Networks, Planar Graphs, Maximum Flows, Minimum Cuts
- Klassifikation (DDC)
- 006
- URN Qucosa
- urn:nbn:de:bsz:15-qucosa2-328032
- Veröffentlichungsdatum Qucosa
- 25.01.2019
- Dokumenttyp
- Konferenzbeitrag
- Sprache des Dokumentes
- Englisch