Sciweavers

26 search results - page 2 / 6
» Edge Growth in Graph Cubes
Sort
View
AUIC
2003
IEEE
13 years 11 months ago
Keg Master: a Graph-Aware Visual Editor for 3D Graphs
This paper presents Keg Master, a graph-aware visual editor for 3D graphs. Keg Master is novel in that it works with a graph description language as opposed to a scene graph descr...
Hannah Slay, Matthew Phillips, Bruce H. Thomas, Ru...
COMPGEOM
1993
ACM
13 years 10 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
AAAI
2007
13 years 8 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
IPL
2007
71views more  IPL 2007»
13 years 6 months ago
Fault-tolerant analysis of a class of networks
In this paper, we explore the 2-extraconnectivity of a special class of graphs G(G0,G1;M) proposed by Chen et al. [Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, S.-S. Kao, Super-connectivity...
Jun-Ming Xu, Qiang Zhu 0003, Min Xu
GD
1998
Springer
13 years 10 months ago
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
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...
David R. Wood