The Binary Stress Model for Graph Drawing

DOI10.1007/978-3-642-00219-9_19MaRDI QIDQ3611852zbMATH OpenOpenAlexFDO

Authors Yehuda Koren, Ali Çivril

Publication date 3 March 2009

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00219-9_19

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A sparse stress model
• A sparse stress model
• Graph Drawing
• scientific article; zbMATH DE number 2080097
• Constrained graph layout by stress majorization and gradient projection

Cites work

• An r-Dimensional Quadratic Placement Algorithm
• An algorithm for drawing general undirected graphs
• Drawing graphs. Methods and models
• Graph Drawing
• Graph Drawing
• How to Draw a Graph
• scientific article; zbMATH DE number 2084291 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 2080097 (Why is no real title available?)
• scientific article; zbMATH DE number 2080099 (Why is no real title available?)
• Modern multidimensional scaling: theory and applications

Cited in

(4)

• A sparse stress model
• A sparse stress model
• Graph Drawing
• Stress of a graph and its computation

This page was built for publication: The Binary Stress Model for Graph Drawing

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