Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks

zbMATH Open1474.05376MaRDI QIDQ5859883FDOQ5859883

Authors: Daisuke Watanabe 

Publication date: 18 November 2021

Recommendations

• Connected spatial networks over random points and a route-length statistic
• Proximity structures for geometric graphs.
• Proximity structures for geometric graphs
• Assessing the efficiency of rapid transit configurations
• Optimal design of two road networks based on their properties

zbMATH Keywords

computational geometrygeometric probabilityproximity graphtransportation network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• Lectures on random Voronoi tessellations
• On the homogeneous planar Poisson point process
• Title not available (Why is that?)
• Isolated nearest neighbors
• Random minimal trees

Cited In (4)

• Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity
• Proximinal sets and connectedness in graphs
• On growing connected \(\beta \)-skeletons
• How \({\beta}\)-skeletons lose their edges

This page was built for publication: Evaluating the configuration and the travel efficiency on proximity graphs as transportation networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859883)