Complexity of graph evolutions
Abstract
A permutation of the elements of a graph is a construction sequence if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an opportunity cost for the construction sequence. Maximum and minimum cost c-sequences are provided for a variety of graphs and are used to measure the complexity of graph-building programs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.