System Structure Analysis: Clustering with Data Bindings
IEEE Transactions on Software Engineering - Annals of discrete mathematics, 24
SCM '89 Proceedings of the 2nd International Workshop on Software configuration management
Discovering, visualizing, and controlling software structure
IWSSD '89 Proceedings of the 5th international workshop on Software specification and design
An Analysis of Some Graph Theoretical Cluster Techniques
Journal of the ACM (JACM)
Covering edges by cliques with regard to keyword conflicts and intersection graphs
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A framework for selective recompilation in the presence of complex intermodule dependencies
Proceedings of the 17th international conference on Software engineering
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Hierarchical Clustering of Trees: Algorithms and Experiments
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Effective Graph Visualization Via Node Grouping
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
Readable Representations for Large-Scale Bipartite Graphs
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
GD'06 Proceedings of the 14th international conference on Graph drawing
Biclique edge cover graphs and confluent drawings
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
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
The display of a directed graph is a commonly used visual aid for representing relationships. However, some graphs contain so many edges that their display by traditional graph layout algorithms is virtually impossible because of the overwhelming number of crossings. Graphs representing large software systems and their configurations are particularly prone to this problem. Examples of such graphs include: graphs depicting a system's configuration, call graphs, graphs depicting import and export relationships between modules, and graphs depicting the “includes” relation among a system's source files.This paper proposes the elimination of some edges by replacing sets of edges that have the same set of source and target nodes by a special node called an edge concentration node. Reducing the number of edges often has the desirable side effect of reducing the number of crossings. An algorithm that determines a reasonable set of edge concentrations of a graph in &Ogr;(n4) operations for each level in the graph is presented where n is the number of nodes in that level. Several examples from the area of software configuration management are shown to demonstrate the effectiveness of using edge concentrations.