Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

SODA
2008
ACM

favoriteEmaildiscussreport

82views Algorithms» more SODA 2008»

On properties of random dissections and triangulations

13 years 10 months ago

On properties of random dissections and triangulations

Download www.mpi-inf.mpg.de

In the past decades the Gn,p model of random graphs, introduced by Erdos and R

Nicla Bernasconi, Konstantinos Panagiotou, Angelik

Real-time Traffic

Algorithms | Degree Sequence | Random | Random Graphs | SODA 2008 |

claim paper

Related Content

» Properties of Random Triangulations and Trees

» On Triangulating Dynamic Graphical Models

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

» Constructing gene coexpression networks and predicting functions of unknown genes by rando...

» Watermarking 2D Vector Maps in the MeshSpectral Domain

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger

Comments (0)