Traffic Analysis in Random Delaunay Tessellations and Other Graphs
arXiv (Cornell University)(2012)
摘要
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ös-Renyi random graphs, geometric random graphs, expanders and random k-regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.
更多查看译文
关键词
Planar Graph Embedding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要