In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...