Finding the Maximal Incidence Matrix of a Large Graph.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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.
- Theoretical Mathematics
- Computer Programming and Software