Sciweavers

1949 search results - page 200 / 390
» Random graphs on surfaces
Sort
View
GD
2000
Springer
15 years 8 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
UAI
2004
15 years 6 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
137
Voted
TOMS
2010
106views more  TOMS 2010»
15 years 3 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
3DIM
2005
IEEE
15 years 10 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...
SI3D
2012
ACM
14 years 17 days ago
4D parametric motion graphs for interactive animation
A 4D parametric motion graph representation is presented for interactive animation from actor performance capture in a multiple camera studio. The representation is based on a 4D ...
Dan Casas, Margara Tejera, Jean-Yves Guillemaut, A...