Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are `dynamic' in the sense that...
In this paper it is shown that a class of almost-median graphs that includes all planar almost-median graphs can be recognized in O(m log n) time, where n denotes the number of ve...
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
In the previous studies on k-edge fault tolerance with respect to hypercubes Qn, matrices for generating linear k-EFT(Qn) graphs were used. Let EFTL(n, k) denote the set of matric...
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
Vida Dujmovic, Michael R. Fellows, Michael T. Hall...