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
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
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Title not available (Why is that?)
- Estimation From Relative Measurements: Electrical Analogy and Large Graphs
- Extremal infinite graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculating the edge Wiener and edge Szeged indices of graphs
- An optimal path planning problem for heterogeneous multi-vehicle systems
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- \(3n-5\) edges do force a subdivision of \(K_5\)
- Largest planar graphs and largest maximal planar graphs of diameter two
- Title not available (Why is that?)
- Applications of percolation theory
- Forcing large complete (topological) minors in infinite graphs
- Modeling nonlinear road traffic networks for junction control
- Title not available (Why is that?)
- The Size of a Graph Without Topological Complete Subgraphs
- Extremal Graphs without Topological Complete Subgraphs
- Title not available (Why is that?)
- Local dependency in networks
- Bemerkungen zu Hadwigers Vermutung
Cited In (2)
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)
