Abstract
Effective tools are crucial for visualizing large quantities of information. While developing these tools, numerous graph drawing problems emerge. We present solutions for reducing clutter in a radial visualization of a bipartite graph representing the alerts generated by an IDS protecting a computer network. Our solutions rely essentially on (i) unambiguous edge bundling to reduce the number of edges to display and (ii) the minimization of the total sum of the edge lengths. © 2012 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Dumas, M., McGuffin, M. J., Robert, J. M., & Willig, M. C. (2012). Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7034 LNCS, pp. 203–214). https://doi.org/10.1007/978-3-642-25878-7_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
