SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT

DOI10.1142/S0129183107011558zbMATH Open1145.68580OpenAlexW1987406025MaRDI QIDQ3500260FDOQ3500260

M. M. Geipel

Publication date: 3 June 2008

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129183108012169

Recommendations

• Dynamic Spectral Layout with an Application to Small Worlds
• Graph Drawing
• An algorithm for drawing general undirected graphs
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• Visualizing Large and Clustered Networks

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Cites Work

• Exploring complex networks
• An algorithm for drawing general undirected graphs
• Modeling vortex swarming in daphnia
• Dynamic WWW Structures in 3D

Cited In (7)

• Title not available (Why is that?)
• Spatio-temporal organization of a cellular automaton model for computer network
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• Self-organization scheme for balanced routing in large-scale multi-hop networks
• Self-organized critical traffic in parallel computer networks
• A novel self-adaption macroscopic fundamental diagram considering network heterogeneity
• From Graph Theory to Models of Economic Networks. A Tutorial

This page was built for publication: SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT

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