Accession Number : ADA017331

Title :   Finding the Maximal Incidence Matrix of a Large Graph.

Descriptive Note : Technical rept.,

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Overton,Michael ; Proskurowski,Andrzej

Report Date : SEP 1975

Pagination or Media Count : 75

Abstract : The 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.

Descriptors :   *Search theory, *Computer programs, Recursive functions, Matrices(Mathematics), Theorems

Subject Categories : Theoretical Mathematics
      Computer Programming and Software

Distribution Statement : APPROVED FOR PUBLIC RELEASE