Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2014.06.040 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2014.06.040 / rank | |||
Normal rank | |||
Latest revision as of 17:29, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs |
scientific article |
Statements
Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (English)
0 references
27 August 2014
0 references
graph algorithms
0 references
matchings
0 references
correlation decay
0 references
approximation algorithms
0 references
random sampling
0 references
0 references
0 references
0 references
