BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-509
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Finding the maximal incidence matrix of a large graph.
        TYPE:: Technical Report
      AUTHOR:: Overton, Michael L.
      AUTHOR:: Proskurowski, Andrzej
        DATE:: September 1975
       PAGES:: 76
    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.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-509