Showing papers on "K-tree published in 1975"
TL;DR: CliqueUE as discussed by the authors is a suite of programs centered around the extraction of maximal complete graphs from a binary symmetric matrix representing a continuous similarity/difference or a binary relation among entities.
Abstract: CLIQUE is the generic name for a suite of programs centered around the extraction of maximal complete graphs from a binary symmetric matrix representing a continuous similarity/difference or a binary relation among entities. Its features include the following: derivation of a graph from measures either of similarity or difference, the possibility of employing tests of statistical significance in deriving the input graph or in subsequent clusterings based on the cliques, output allowing investigation of all cliques containing any single element, or permitting a two-stage analysis in which the elements contained in cliques on the second pass correspond to cliques extracted on the first pass. Applicability extends to a considerable range of input data.
3 citations
TL;DR: In this paper, a study is made of non-regular planar 3-connected graphs with constant weight, where the weights of the vertices of the graphs have constant number of vertices.
Abstract: A study is made of the non-regular planar 3-connected graphs with constant weight.
3 citations