DETERMINATION OF MAXIMALLY COMPLETE SUBGRAPHS.
Interim technical rept.,
MOORE SCHOOL OF ELECTRICAL ENGINEERING PHILADELPHIA PA
Pagination or Media Count:
Development of information retrieval schemes and library classification systems for library automation has created a need for the determination of all maximally complete subgraphs of an arbitrary non-direct graph. This paper describes an algorithm developed for the efficient solution of this problem on modern digital computers. The algorithm is presented in a settheoretic notation, since it may be of interest to those working in fields other than information retrieval or library classification systems. The algorithm has been programmed in FAP for the IBM 7094. The program is documented in an appendix, and the results of a few applications to real library files and pseudo-random data are presented. Author