Resumen de A note on López-Hernández procedure: New non-hierarchical algorithms in classification of data
In this short note, we make a critique about the procedure developed in the Inductive Algorithm in the Objects of López-Hernández (1997). It is well known that the determination of maximal cliques in a ghaph is an important problem because it appears in many diverse applications. However, many clique detection algorithms have been developed (most of them in the 60's and 70's) in spite of its high complexity (NP-hard problem). In the case of the referred procedure, a methodological justification and computational results would have been desirable.
