Incremental distance and diameter sequences of a graph: new measures of network performance

DOI10.1109/12.45208zbMATH Open1395.68035OpenAlexW2134239708MaRDI QIDQ5375438

Author name not available (Why is that?)

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.45208

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Defining a new graph inefficiency measure for the proportional directional distance function and introducing a new Malmquist productivity index

This page was built for publication: Incremental distance and diameter sequences of a graph: new measures of network performance

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