Sequential Monte Carlo for counting vertex covers in general graphs (Q294226): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11222-015-9546-9 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60J22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / 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: 90C39 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6591370 / rank
 
Normal rank
Property / zbMATH Keywords
 
vertex cover
Property / zbMATH Keywords: vertex cover / rank
 
Normal rank
Property / zbMATH Keywords
 
counting problem
Property / zbMATH Keywords: counting problem / rank
 
Normal rank
Property / zbMATH Keywords
 
sequential importance sampling
Property / zbMATH Keywords: sequential importance sampling / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / zbMATH Keywords
 
relaxation
Property / zbMATH Keywords: relaxation / rank
 
Normal rank
Property / zbMATH Keywords
 
random graphs
Property / zbMATH Keywords: random graphs / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095363193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic simulation: Algorithms and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Monte Carlo simulation via the generalized splitting method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Monte Carlo Methods for Statistical Analysis of Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant / 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: Approximate counting by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of hypercube graphs / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo algorithms for the planar multiterminal network reliability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte-Carlo approximation algorithms for enumeration problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPTAS for Counting Monotone CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately counting cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gibbs cloner for combinatorial optimization, counting and sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic enumeration method for counting NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation and the Monte Carlo Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Splitting Method for Decision Making / 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: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11222-015-9546-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:37, 9 December 2024

scientific article
Language Label Description Also known as
English
Sequential Monte Carlo for counting vertex covers in general graphs
scientific article

    Statements

    Sequential Monte Carlo for counting vertex covers in general graphs (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    vertex cover
    0 references
    counting problem
    0 references
    sequential importance sampling
    0 references
    dynamic programming
    0 references
    relaxation
    0 references
    random graphs
    0 references
    0 references

    Identifiers

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