Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6334627 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
matchings
Property / zbMATH Keywords: matchings / rank
 
Normal rank
Property / zbMATH Keywords
 
correlation decay
Property / zbMATH Keywords: correlation decay / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
random sampling
Property / zbMATH Keywords: random sampling / rank
 
Normal rank

Revision as of 16:28, 29 June 2023

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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references