Document Type

Conference Proceeding

Publication Date

2018

Abstract

Finding bottlenecks and eliminating them to in-crease the overall flow of a network often appears in real world applications, such as production planning, factory layout, flowrelated 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.

Comments

This work is licensed under a Creative Commons Attribution 4.0 InternationalLicense (CC BY 4.0).

Download


Share

COinS