An advance in infinite graph models for the analysis of transportation networks (Q511389): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1515/amcs-2016-0061 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6684773 / rank
 
Normal rank
Property / zbMATH Keywords
 
infinite graph
Property / zbMATH Keywords: infinite graph / rank
 
Normal rank
Property / zbMATH Keywords
 
average degree
Property / zbMATH Keywords: average degree / rank
 
Normal rank
Property / zbMATH Keywords
 
extremal problems
Property / zbMATH Keywords: extremal problems / rank
 
Normal rank
Property / zbMATH Keywords
 
road transport network
Property / zbMATH Keywords: road transport network / rank
 
Normal rank
Property / zbMATH Keywords
 
percolation
Property / zbMATH Keywords: percolation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/amcs-2016-0061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2579054353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation From Relative Measurements: Electrical Analogy and Large Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of a Graph Without Topological Complete Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Graphs without Topological Complete Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5826299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5697113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3735714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal path planning problem for heterogeneous multi-vehicle systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local dependency in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(3n-5\) edges do force a subdivision of \(K_5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling nonlinear road traffic networks for junction control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of percolation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal infinite graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing Large Complete (Topological) Minors in Infinite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bemerkungen zu Hadwigers Vermutung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest planar graphs and largest maximal planar graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Calculating the edge Wiener and edge Szeged indices of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1515/AMCS-2016-0061 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:59, 9 December 2024

scientific article
Language Label Description Also known as
English
An advance in infinite graph models for the analysis of transportation networks
scientific article

    Statements

    An advance in infinite graph models for the analysis of transportation networks (English)
    0 references
    0 references
    0 references
    15 February 2017
    0 references
    infinite graph
    0 references
    average degree
    0 references
    extremal problems
    0 references
    road transport network
    0 references
    percolation
    0 references

    Identifiers