81 search results - page 1 / 17 » Properties of Random Triangulations and Trees |
DCG
1999
13 years 4 months ago
1999
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
AAAI
2011
12 years 4 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
DMTCS
2010
13 years 2 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
WG
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...