Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
Melanie Badent, Michael Baur, Ulrik Brandes, Sabin...
In this paper we present a novel and fast estimation technique that produces tight latency lower bounds for Data Flow Graphs representing time critical segments of the application...