2010/02/05 by Paul Baird, Baird, Paul, Marius Tiba +1
Computer Science · Mathematics · #05C60 #05C85 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1002.1192
openalex publication_date 2010/02/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.