"An improved upper bound for the pebbling threshold of the n-path."

Adam Wierman et al. (2004)

Details and statistics

DOI: 10.1016/J.DISC.2002.10.001

access: open

type: Journal Article

metadata version: 2021-02-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics