2
$\begingroup$

I am interested in Graph Pebbling, and in particular what are the fastest known algorithm is to find the pebbling number of a graph. Also, i am interested whether there are lower limits on the runtime of such algorithms.

I am aware of the paper by Nandor Sieben proposing a graph pebbling algorithm, however it is 10 years old and I am interested whether there have been improvements on this algorithm, therefore my question is:

What is the fastest algorithm calculating the graph pebbling number of a Graph?

Improve this question
$\endgroup$
1
  • 1
    $\begingroup$ this 2019 article on pebbling numbers only mentions the Sieben algorithm, so I would presume that is all there is. $\endgroup$
    – Carlo Beenakker
    Commented Mar 11, 2019 at 9:17

0

Reset to default

You must log in to answer this question.

Browse other questions tagged .