This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of Kn have volume Ω(n 3)? (2) Is there a drawing of Kn for which additionally the vertices are represented by cubes with surface O(n)? This paper answers both questions in the negative, and provides related results concerning volume bounds as well. Communicated by G. Liotta: submitted May 2000
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
This paper studies the question: What is the maximum integer k_b,n such that every k_b,n-colorable g...
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular,...
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular,...
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provid...
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provid...
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the moveme...
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the moveme...
In this paper, we study orthogonal graph drawings in three dimensions with nodes drawn as boxes. The...
In this paper, we study orthogonal graph drawings in three dimensions with nodes drawn as boxes. The...
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a l...
Abstract. In this paper we present an algorithm for 3-dimensional or-thogonal graph drawing based on...
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a l...
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, inte...
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
This paper studies the question: What is the maximum integer k_b,n such that every k_b,n-colorable g...
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular,...
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, K_{n} in particular,...
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provid...
In this paper, we study three-dimensional orthogonal box-drawings of graphs without loops. We provid...
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the moveme...
In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the moveme...
In this paper, we study orthogonal graph drawings in three dimensions with nodes drawn as boxes. The...
In this paper, we study orthogonal graph drawings in three dimensions with nodes drawn as boxes. The...
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a l...
Abstract. In this paper we present an algorithm for 3-dimensional or-thogonal graph drawing based on...
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a l...
We use basic results from graph theory to design two algorithms for constructing 3-dimensional, inte...
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
We use basic results from graph theory to design two algorithms for constructing 3-dimesional, inter...
This paper studies the question: What is the maximum integer k_b,n such that every k_b,n-colorable g...