Search

Showing total 2 results
2 results

1. Algorithm 457 Finding All Cliques of an Undirected Graph [ H ].

Author

Bron, Coen, Kerbosch, Joep, Roy, Mohit Kumar, Lawrence, E. E., and Williamson, Hugh

Subjects
*ALGORITHMS, *GRAPH theory, *BRANCH & bound algorithms, *MATHEMATICAL programming, *ALGEBRA, *MATHEMATICS
Abstract

The article reports on finding all subgraphs of an undirected graph [H]. A maximal complete subgraph is also called clique which refers to a complete subgraph that is not included in any other complete subgraph. According to the authors, a research paper was released wherein descriptions of techniques to find maximal complete subgraphs are provided. The authors discussed two algorithms using a branch-and-bound technique so that there will be no clique. The first algorithm produces cliques in lexicographic order while the second is derived from the first algorithm.

Published
1973
Full Text
View/download PDF

2. Error-Free Methods for Statistical Computations.

Author

Rodden, B. E.

Subjects
*ALGORITHMS, *ALGEBRA, *MATHEMATICS, *MATHEMATICAL statistics, *ERROR analysis in mathematics, *COMPUTER algorithms
Abstract

Neely has discussed computational error generated by some algorithms used to compute various statistics. In the present paper methods are described which are error-free, simple in concept, and usually less costly in machine time than those mentioned by Neely. [ABSTRACT FROM AUTHOR]

Published
1967
Full Text
View/download PDF