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.

翻译：图的元素排列若满足“无边在其任一端点之前列出”的条件，则称为一个构造序列。通过计算放置边时的延迟——即构造序列的机会成本——来研究此类序列的复杂性。本文针对多种图结构给出了最大与最小成本c序列，并以此度量图构建程序的复杂度。