81 search results - page 1 / 17 » Properties of Random Triangulations and Trees |
116
click to vote
DCG
1999
15 years 2 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...
100
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In the past decades the Gn,p model of random graphs, introduced by Erdos and R
129
click to vote
AAAI
2011
14 years 2 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...
140
Voted
DMTCS
2010
15 years 9 days 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...
129
click to vote
WG
2005
Springer
15 years 8 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 ...