Finding the maximal incidence matrix of a large graph.

[摘要] This paper deals with the computation of two canonical representations of a graph. A computer program is presented which searches for "the maximal incidence matrix" of a large connected graph without multiple edges or self-loops. The use of appropriate algorithms and data structures is discussed.

[学科分类] 计算机科学（综合）