Complexity of graph evolutions
Combinatorics
2024-12-03 v1 Discrete Mathematics
Abstract
A permutation of the elements of a graph is a {\it 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 {\it 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.
Keywords
Cite
@article{arxiv.2412.00212,
title = {Complexity of graph evolutions},
author = {Jeffrey Gao and Paul C. Kainen},
journal= {arXiv preprint arXiv:2412.00212},
year = {2024}
}