scientific article; zbMATH DE number 1693473

MaRDI QIDQ2764044zbMATH OpenFDO

Authors Ralf Brockenauer, Sabine Cornelsen

Publication date 22 January 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2025/20250193

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99)

Recommendations

• Navigating Clustered Graphs Using Force-Directed Methods
• Graph Drawing
• Planarity-preserving clustering and embedding for large planar graphs
• scientific article; zbMATH DE number 1500683
• Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Cited in

(20)

• How to draw a clustered tree
• A quality metric for visualization of clusters in graphs
• Multi-level graph drawing using infomap clustering
• Untangling hairballs. From 3 to 14 degrees of separation
• scientific article; zbMATH DE number 4213494 (Why is no real title available?)
• Drawing Graphs Within Graphs
• Visualizing Large and Clustered Networks
• How to Draw a Clustered Tree
• Visual Analysis of One-to-Many Matched Graphs
• Navigating Clustered Graphs Using Force-Directed Methods
• Drawing clustered graphs as topographic maps
• Schematic representation of large biconnected graphs
• Large graph visualization from a hierarchical node clustering
• Problems of visualization of citation networks for large-science-portals
• Graph Drawing
• Graph Drawing
• MapSets: visualizing embedded and clustered graphs
• Graph Drawing
• Graph Drawing
• Fast layout computation of clustered networks: algorithmic advances and experimental analysis

This page was built for publication:

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