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
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2014.06.040 / rank
Normal rank
 
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2795470862 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1208.3629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistical mechanics of strategic interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for sampling algorithms for estimating the average / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Spanning Tree Weight in Sublinear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and walks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating average parameters of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Stars and Other Small Subgraphs in Sublinear-Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random matchings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Counting via Correlation Decay in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Decay up to Uniqueness in Spin Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lee-Yang theorems and the complexity of computing averages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting independent sets up to the tree threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved constant-time approximation algorithm for maximum~matchings / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2014.06.040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16: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
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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