Visualizing Large and Clustered Networks

DOI10.1007/978-3-540-70904-6_24zbMATH Open1185.68488OpenAlexW1564996061MaRDI QIDQ3595485FDOQ3595485

Authors: Stephan Kottler, Katharina A. Zweig 

Publication date: 28 August 2007

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_24

Recommendations

• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• scientific article; zbMATH DE number 1693473
• Large graph visualization from a hierarchical node clustering
• Graph Drawing
• LunarVis – Analytic Visualizations of Large Graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (14)

• Untangling hairballs. From 3 to 14 degrees of separation
• Clustering, Visualizing, and Navigating for Large Dynamic Graphs
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Title not available (Why is that?)
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• Extracting backbones from weighted complex networks with incomplete information
• SELF-ORGANIZATION APPLIED TO DYNAMIC NETWORK LAYOUT
• Title not available (Why is that?)
• Untangling the hairballs of multi-centered, small-world online social media networks
• LunarVis – Analytic Visualizations of Large Graphs
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis
• Visualizing a Large-Scale Structure of Production Network by N-Body Simulation
• Large graph visualization from a hierarchical node clustering
• Generalizing geometric graphs

This page was built for publication: Visualizing Large and Clustered Networks

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