A method of characterizing network topology based on the breadth-first search tree

DOI10.1016/J.PHYSA.2015.12.160MaRDI QIDQ1619360zbMATH OpenOpenAlexFDO

Authors R. Smith

Publication date 13 November 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2015.12.160

zbMATH Keywords

network topologynetwork similarity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Characterizing the flow equivalent trees of a network
• Tree-based networks: characterisations, metrics, and support trees
• Determination of the topology of a directed network
• New characterisations of tree-based networks and proximity measures
• On determining if tree-based networks contain fixed trees
• scientific article; zbMATH DE number 2088903
• Inferring network topology via the propagation process
• On topological properties of hierarchical interconnection networks
• Network-Tree Model and Shortest Path Algorithm

Cites work

• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Exploring complex networks
• The Structure and Function of Complex Networks

This page was built for publication: A method of characterizing network topology based on the breadth-first search tree

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