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 pebbles. The pebbling number of a graph is the fewest number of pebbles $t$ so that, from any initial configuration of $t$ peb...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on discrete mathematics 2014-01, Vol.28 (3), p.1449-1466
Hauptverfasser:	Alcon, Liliana, Gutierrez, Marisa, Hurlbert, Glenn
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Consumption Graphs Mathematical models Neighborhoods Optimization Orange peel Polynomials Transporting
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!