An algorithm to prescribe the configuration of a finite graph
Combinatorics
2010-02-08 v1
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.
Keywords
Cite
@article{arxiv.1002.1192,
title = {An algorithm to prescribe the configuration of a finite graph},
author = {Paul Baird and Marius Tiba},
journal= {arXiv preprint arXiv:1002.1192},
year = {2010}
}