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

DOI10.1016/J.PHYSA.2015.12.160zbMATH Open1400.90077OpenAlexW2298162174MaRDI QIDQ1619360

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)

Cites Work

• Unnamed Item
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks

Recommendations

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

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