Constrained graph layout by stress majorization and gradient projection
type: Item
instance of: scholarly article
title: Constrained graph layout by stress majorization and gradient projection
zbMATH Open document ID: 1201.05093
author: Tim Dwyer
author: Yehuda Koren
author: Kim Marriott
published in: Discrete Mathematics
publication date: 2009-04-09T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5542416
zbMATH Keywords: graph drawing
zbMATH Keywords: constraints
zbMATH Keywords: stress majorization
zbMATH Keywords: gradient projection
describes a project that uses: IPSep-CoLa
describes a project that uses: MatrixMarket
MaRDI profile type: Publication
full work available at URL: j.disc.2007.12.103
OpenAlex ID: W2134697945
cites work: Q5658961
cites work: Q4209222
cites work: Modern multidimensional scaling. Theory and applications.
cites work: Graph Drawing
cites work: Navigating Clustered Graphs Using Force-Directed Methods
cites work: Q4858141
cites work: Constrained graph layout
cites work: An algorithm for drawing general undirected graphs
cites work: Numerical Optimization
cites work: Warm-start strategies in interior-point methods for linear programming
DOI: 10.1016/J.DISC.2007.12.103
Recommended article: Constrained graph layout
Recommended article: Topology Preserving Constrained Graph Layout
Recommended article: Graph layout with versatile boundary constraints
Recommended article: Graph Drawing
Recommended article: Q4472309
Recommended article: A multi-dimensional approach to force-directed layouts of large graphs
Recommended article: Constraints in graph drawing algorithms
Recommended article: Removing node overlapping in graph layout using constrained optimization
description: scientific article; zbMATH DE number 5542416