Reinforcing the spring algorithms: the Taguchi approach

DOI10.17654/DM017020201zbMATH Open1404.68086OpenAlexW2345980426MaRDI QIDQ2968239FDOQ2968239

Authors: Ismo Lapinleimu, Erkki Mäkinen 

Publication date: 10 March 2017

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/9789.htm

Recommendations

• An algorithm for drawing general undirected graphs
• Spring algorithms and symmetry
• scientific article; zbMATH DE number 1088274
• Large-Graph Layout Algorithms at Work: An Experimental Study
• A multi-scale algorithm for drawing graphs nicely

zbMATH Keywords

algorithmsgraph drawingspring algorithmsdesigning of experiments

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (2)

• Title not available (Why is that?)
• Planar preprocessing for spring embedders

This page was built for publication: Reinforcing the spring algorithms: the Taguchi approach

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