A maximum clique derivation algorithm for simplification of incompletely specified machines
Masaki Hashizume, T. Tamesada, Akio Sakamoto · 1994
In this paper, derivation problems of maximum cliques are discussed, which take place in simplification processes of incompletely specified machines. In many cases, graphs consisting of a lot of edges are generated in the processes. Thus, for many combinations of the edges, it should be examined whether a clique is made of them. Therefore, it is impossible to derive the maximum cliques within a reasonable time. This paper presents a new algorithm to derive all the maximum cliques, which is more suitable for the derivation of maximum cliques of the undirected graphs generated in the simplification processes.>