Sequential Monte Carlo for counting vertex covers in general graphs

Radislav Vaisman; Zdravki I. Botev; Ad Ridder

Year of publication:	2013
Authors:	Vaisman, Radislav ; Botev, Zdravki I. ; Ridder, Ad
Publisher:	Rotterdam
Subject:	Vertex cover \| Counting problem \| Sequential importance sampling \| Dynamic programming \| Relaxation \| Random graphs \| Graphentheorie \| Graph theory \| Stichprobenerhebung \| Sampling \| Monte-Carlo-Simulation \| Monte Carlo simulation \| Dynamische Optimierung

freely available

Full text |

More access options

econpapers.repec.org

papers.tinbergen.nl

Check Google Scholar

In German libraries (KVK)

Which error do you want to report?

Report: URL of this record is broken

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: Addition of an URL to that resource

Please note: Sometimes more than one URL is available for a resource. Please click on "More Options" to display these URLs

Report: The language(s) of that resource is/are…

Please note: Required language not in the list? Please use comment field

Report: Addition of an identifier to that resource

Report: report typo

Report: Add statement

Report: Add keywords

Please use the commentary box to describe other errors

Would you like to receive a feedback?

Commentary

Please type the code from the image

For general questions please use this address.

Persistent link: https://www.econbiz.de/10010191297

A service of the