Report Number: CS-TR-75-509
Institution: Stanford University, Department of Computer Science
Title: Finding the maximal incidence matrix of a large graph.
Author: Overton, Michael L.
Author: Proskurowski, Andrzej
Date: September 1975
Abstract: 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.