A fast successive over-relaxation algorithm for force-directed network graph drawing (Q439759): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Yong-Xian Wang / rank
Normal rank
 
Property / author
 
Property / author: Zheng-Hua Wang / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C62 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6067117 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph drawing
Property / zbMATH Keywords: graph drawing / rank
 
Normal rank
Property / zbMATH Keywords
 
graph layout
Property / zbMATH Keywords: graph layout / rank
 
Normal rank
Property / zbMATH Keywords
 
successive over-relaxation
Property / zbMATH Keywords: successive over-relaxation / rank
 
Normal rank
Property / zbMATH Keywords
 
force-directed algorithm
Property / zbMATH Keywords: force-directed algorithm / rank
 
Normal rank
Property / author
 
Property / author: Yong-Xian Wang / rank
 
Normal rank
Property / author
 
Property / author: Zheng-Hua Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098135377 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.01228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for drawing general undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional graph drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing graphs. Methods and models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2759609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmetric multidimensional scaling. A numerical method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the majorization method for multidimensional scaling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating Edge Routing into Force-Directed Layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Stress Majorization Using Diagonally Scaled Gradient Projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained graph layout by stress majorization and gradient projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid layout algorithm based on skeleton subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution of Nonlinear Equations in Several Variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:19, 5 July 2024

scientific article
Language Label Description Also known as
English
A fast successive over-relaxation algorithm for force-directed network graph drawing
scientific article

    Statements

    A fast successive over-relaxation algorithm for force-directed network graph drawing (English)
    0 references
    17 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    graph drawing
    0 references
    graph layout
    0 references
    successive over-relaxation
    0 references
    force-directed algorithm
    0 references
    0 references
    0 references
    0 references
    0 references