{
  "id": "1002.1192",
  "version": "v1",
  "published": "2010-02-05T10:40:53.000Z",
  "updated": "2010-02-05T10:40:53.000Z",
  "title": "An algorithm to prescribe the configuration of a finite graph",
  "authors": [
    "Paul Baird",
    "Marius Tiba"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-02-05T10:40:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C85",
      "05C60"
    ],
    "keywords": [
      "finite graph",
      "connected simple graph",
      "appropriate energy functional",
      "edge slides",
      "finite number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1002.1192B"
    }
  }
}