Simplification of graph structure with the aid of boolean matrices (Q2266720): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Ilya B. Muchnik / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Vladimir Fleischer / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 07:32, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simplification of graph structure with the aid of boolean matrices |
scientific article |
Statements
Simplification of graph structure with the aid of boolean matrices (English)
0 references
1983
0 references
In the paper the problem of the simplification of the aggregated structure of large empirical graphs is considered. It is shown how this problem can be solved by representing the Boolean matrices as a product of other Boolean matrices of smaller dimension.
0 references
Boolean linear forms
0 references
Boolean matrices
0 references
