Pages that link to "Item:Q1420621"
From MaRDI portal
The following pages link to An improved upper bound for the pebbling threshold of the \(n\)-path (Q1420621):
Displaying 7 items.
- General graph pebbling (Q385150) (← links)
- Counterexamples to a monotonicity conjecture for the threshold pebbling number (Q442335) (← links)
- Upper and lower I/O bounds for pebbling \(r\)-pyramids (Q450538) (← links)
- On the pebbling threshold of paths and the pebbling threshold spectrum (Q932604) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Threshold and complexity results for the cover pebbling game (Q1025557) (← links)
- Thresholds for families of multisets, with an application to graph pebbling (Q1402065) (← links)