[PDF][PDF] Graph pebbling
G Hurlbert - Handbook of graph theory, 2013 - glennhurlbert.github.io
The graph pebbling model we study here was born as a method for solving a combinatorial
number theory conjecture of Erdős and Lemke and has since been applied to problems in …
number theory conjecture of Erdős and Lemke and has since been applied to problems in …
The weight function lemma for graph pebbling
G Hurlbert - Journal of Combinatorial Optimization, 2017 - Springer
Graph pebbling is a network model for studying whether or not a given supply of discrete
pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge …
pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge …
Pebbling in split graphs
Graph pebbling is a network optimization model for transporting discrete resources that are
consumed in transit: the movement of 2 pebbles across an edge consumes one of the …
consumed in transit: the movement of 2 pebbles across an edge consumes one of the …
t-Pebbling and Extensions
DS Herscovici, BD Hester, GH Hurlbert - Graphs and Combinatorics, 2013 - Springer
Graph pebbling is the study of moving discrete pebbles from certain initial distributions on
the vertices of a graph to various target distributions via pebbling moves. A pebbling move …
the vertices of a graph to various target distributions via pebbling moves. A pebbling move …
[HTML][HTML] Pebbling in semi-2-trees
Graph pebbling is a network model for transporting discrete resources that are consumed in
transit. Deciding whether a given configuration on a particular graph can reach a specified …
transit. Deciding whether a given configuration on a particular graph can reach a specified …
Automating weight function generation in graph pebbling
Graph pebbling is a combinatorial game played on an undirected graph with an initial
configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex …
configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex …
A graph pebbling algorithm on weighted graphs
N Sieben - arXiv preprint arXiv:0904.1651, 2009 - arxiv.org
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one
pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge …
pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge …
[PDF][PDF] Online games as social-computational systems for solving np-complete problems
C Cusack, J Largent, R Alfuth, K Klask - Meaningful play, 2010 - academia.edu
This paper discusses the applicability of human computing games to solving instances of NP-
complete problems, a collection of problems that cannot currently be efficiently solved with …
complete problems, a collection of problems that cannot currently be efficiently solved with …
[HTML][HTML] The complexity of pebbling reachability and solvability in planar and outerplanar graphs
T Lewis, CA Cusack, L Dion - Discrete Applied Mathematics, 2014 - Elsevier
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …
The complexity of pebbling in diameter two graphs
Given a simple, connected graph, a pebbling configuration is a function from its vertex set to
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …
the nonnegative integers. A pebbling move between adjacent vertices removes two pebbles …