A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
Enabling the user of a graph drawing system to preserve the mental map between two different layouts of a graph is a major problem. In this paper we present methods that smoothly ...
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...