BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-73-361
       ENTRY:: September 25, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An algorithm for the construction of the graphs of organic
               molecules.
        TYPE:: Technical Report
      AUTHOR:: Brown, Harold
      AUTHOR:: Masinter, Larry M.
        DATE:: May 1973
       PAGES:: 27
    ABSTRACT:: A description and a formal proof of an efficient computer
               implemented algorithm for the construction of graphs is
               presented. This algorithm, which is part of a program for the
               automated analysis of organic compounds, constructs all of
               the non-isomorphic, connected multi-graphs based on a given
               degree sequence of nodes and which arise from a relatively
               small "catolog" of certain canonical graphs. For the graphs
               of the more common organic molecules, a catolog of most of
               the canonical graphs is known, and the algorithm can produce
               all of the distinct valence isomers of these organic
               molecules.
       NOTES:: [Adminitrivia V1/Prg/19950925]
         END:: STAN//CS-TR-73-361