Randomly orthogonal factorizations with constraints in bipartite networks (Q1663915)
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: Randomly orthogonal factorizations with constraints in bipartite networks |
scientific article; zbMATH DE number 6924707
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomly orthogonal factorizations with constraints in bipartite networks |
scientific article; zbMATH DE number 6924707 |
Statements
Randomly orthogonal factorizations with constraints in bipartite networks (English)
0 references
24 August 2018
0 references
network
0 references
bipartite graph
0 references
subgraph
0 references
\((g,f)\)-factor
0 references
\(r\)-orthogonal factorization
0 references
0 references
0.8499314785003662
0 references
0.8484218716621399
0 references
0.8385102152824402
0 references
0.8363280892372131
0 references
0.8172337412834167
0 references
