Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6334627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs |
scientific article; zbMATH DE number 6334627 |
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
0 references
0 references
0.995341658592224
0 references
0.784709632396698
0 references
0.7815693020820618
0 references
0.763048529624939
0 references
0.7545118927955627
0 references
