A bayesian paradigm for dynamic graph layout
Open Access
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 236-247
- https://doi.org/10.1007/3-540-63938-1_66
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Drawing graphs nicely using simulated annealingACM Transactions on Graphics, 1996
- Incremental layout in DynaDAGPublished by Springer Nature ,1996
- Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-DigraphsSIAM Journal on Computing, 1995
- Image Analysis, Random Fields and Dynamic Monte Carlo MethodsPublished by Springer Nature ,1995
- Using constraints to achieve stability in automatic graph layout algorithmsPublished by Association for Computing Machinery (ACM) ,1990
- On Embedding a Graph in the Grid with the Minimum Number of BendsSIAM Journal on Computing, 1987
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of ImagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984