Network Intrusion Detection: An Analyst's Handbook
Network Intrusion Detection: An Analyst's Handbook
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Crossing minimization problems of drawing bipartite graphs in two clusters
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
IDS RainStorm: Visualizing IDS Alarms
VIZSEC '05 Proceedings of the IEEE Workshops on Visualization for Computer Security
Visual Correlation of Network Alerts
IEEE Computer Graphics and Applications
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
IEEE Transactions on Visualization and Computer Graphics
Graph Drawing for Security Visualization
Graph Drawing
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
GD'06 Proceedings of the 14th international conference on Graph drawing
Improving layered graph layouts with edge bundling
GD'10 Proceedings of the 18th international conference on Graph drawing
| Hi-index | 0.00 |
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.