An algorithm to prescribe the configuration of a finite graph
classification
🧮 math.CO
keywords
graphconfigurationconnectedfinitesimplealgorithmalgorithmsanother
read the original abstract
We provide algorithms involving edge slides, for a connected simple graph to evolve in a finite number of steps to another connected simple graph in a prescribed configuration, and for the regularization of such a graph by the minimization of an appropriate energy functional.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.