Name
Title | ||
|---|---|---|
Optimizing a radial layout of bipartite graphs for a tool visualizing security alerts |
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25878-7_20 | Graph Drawing |
Keywords | Field | DocType |
total sum,radial layout,unambiguous edge,numerous graph,large quantity,edge length,bipartite graph,effective tool,radial visualization,present solution,computer network | Graph drawing,Clutter,Visualization,Computer science,Bipartite graph,Theoretical computer science,Quantities of information,Minification | Conference |
Volume | ISSN | Citations |
7034 | 0302-9743 | 2 |
PageRank | References | Authors |
0.40 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maxime Dumas | 1 | 6 | 1.13 |
| Michael J. McGuffin | 2 | 989 | 54.52 |
| Jean-Marc Robert | 3 | 86 | 8.62 |
| Marie-Claire Willig | 4 | 2 | 0.40 |