Time-varying complex network layout algorithm based on node centrality

MaRDI QIDQ3176115zbMATH OpenFDO

Authors Xian Zhou, Xiao Liang, Tinglei Huang

Publication date 18 July 2018

zbMATH Keywords

dynamic rangekey nodePageRank algorithmtime-varying network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• A regularized graph layout framework for dynamic network visualization
• How Important Is the “Mental Map”? – An Empirical Investigation of a Dynamic Graph Layout Algorithm
• Efficiency centrality in time-varying graphs
• An incremental layout method for visualizing online dynamic graphs
• Importance evaluation algorithm of dynamic nodes in social networks based on time series and TOPSIS

Cited in

(2)

• Efficiency centrality in time-varying graphs
• Complex network filtering and compression algorithm based on triangle-subgraph

This page was built for publication: Time-varying complex network layout algorithm based on node centrality

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