Traffic Analysis in Random Delaunay Tessellations and Other Graphs
From MaRDI portal
Publication:6231780
arXiv1203.4863MaRDI QIDQ6231780FDOQ6231780
Authors: John D. Hobby, Gabriel H. Tucci 
Publication date: 21 March 2012
Abstract: In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erd"os-Renyi random graphs, geometric random graphs, expanders and random -regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.
This page was built for publication: Traffic Analysis in Random Delaunay Tessellations and Other Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231780)
