An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (Q2076286)
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: An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem |
scientific article |
Statements
An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem (English)
0 references
16 February 2022
0 references
perfect matching
0 references
exact matching
0 references
degree sequence
0 references
bipartite graph
0 references
Hall's theorem
0 references
joint degree matrix
0 references
partition adjacency matrix
0 references
Monte-Carlo algorithm
0 references
computational complexity
0 references
0 references
0 references
0.7409157752990723
0 references
0.7367877960205078
0 references
0.7233095765113831
0 references
0.7216653823852539
0 references
0.7203472852706909
0 references
