A Hybrid Graph-drawing Algorithm for Large, Naturally-clustered, Disconnected Graphs

In this paper, we present a hybrid graph-drawing algorithm (GDA) for laying out large, naturally-clustered, disconnected graphs. We call it a hybrid algorithm because it is an implementation of a series of already known graph-drawing and graph-theoretic procedures. We remedy in this hybrid the problematic nature of the current force-based GDA which has the inability to scale to large, naturallyclustered, and disconnected graphs. These kinds of graphs usually model the complex inter-relationships among entities in social, biological, natural, and artificial networks. Obviously, the hybrid runs longer than the current GDAs. By using two extreme cases of graphs as inputs, we present the derivation of the time complexity of the hybrid which we found to be O(|V|3), where V is the set of nodes in the graph