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

MaRDI QIDQ5859883zbMATH OpenFDO

Authors Daisuke Watanabe

Publication date 18 November 2021

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)

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

Cites work

• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 3067261 (Why is no real title available?)
• Isolated nearest neighbors
• Lectures on random Voronoi tessellations
• On the homogeneous planar Poisson point process
• 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)