An advance in infinite graph models for the analysis of transportation networks

DOI10.1515/AMCS-2016-0061zbMATH Open1355.05138OpenAlexW2579054353MaRDI QIDQ511389FDOQ511389

Authors Martín Cera, E. M. Fedriani 

Publication date 15 February 2017

Published in International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/amcs-2016-0061

zbMATH Keywords

extremal problemsaverage degreepercolationinfinite graphroad transport network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 1497170
• A new dynamic graph structure for large-scale transportation networks
• scientific article; zbMATH DE number 4079143
• Large-scale network analysis with applications to transportation, communication and inference networks
• A discrete mathematical model of the dynamic evolution of a transportation network
• Modeling the growth of transportation networks: A comprehensive review
• Colored-edge graph approach for the modeling of multimodal transportation systems
• Optimal transportation networks. Models and theory
• New concepts in the vague graph structure with an application in transportation
• Graphical-structure-based models for routing problems

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 1341915 (Why is no real title available?)
• scientific article; zbMATH DE number 897152 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 2214471 (Why is no real title available?)
• scientific article; zbMATH DE number 3087498 (Why is no real title available?)
• An optimal path planning problem for heterogeneous multi-vehicle systems
• Applications of percolation theory
• Bemerkungen zu Hadwigers Vermutung
• Calculating the edge Wiener and edge Szeged indices of graphs
• Estimation From Relative Measurements: Electrical Analogy and Large Graphs
• Extremal Graphs without Topological Complete Subgraphs
• Extremal infinite graph theory
• Forcing large complete (topological) minors in infinite graphs
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Largest planar graphs and largest maximal planar graphs of diameter two
• Local dependency in networks
• Modeling nonlinear road traffic networks for junction control
• The Size of a Graph Without Topological Complete Subgraphs
• \(3n-5\) edges do force a subdivision of \(K_5\)

Cited in

(2)

• scientific article; zbMATH DE number 4079143 (Why is no real title available?)
• Construction of simple path graphs in transport networks. II: Analysis of graphs' biconnectivity

This page was built for publication: An advance in infinite graph models for the analysis of transportation networks

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