Simplification of graph structure with the aid of boolean matrices (Q2266720)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simplification of graph structure with the aid of boolean matrices |
scientific article; zbMATH DE number 3895106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simplification of graph structure with the aid of boolean matrices |
scientific article; zbMATH DE number 3895106 |
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
0.7436434626579285
0 references
0.7423543930053711
0 references
0.7175718545913696
0 references
