Pebbling Algorithms in Diameter Two Graphs

DOI10.1137/080724277MaRDI QIDQ3563930zbMATH OpenOpenAlexFDO

Authors Charles A. Cusack, Airat Bekmetjev

Publication date 1 June 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080724277

zbMATH Keywords

algorithmsconnectivitydiametergraph pebbling

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05)

Recommendations

• The complexity of pebbling in diameter two graphs
• Pebbling graphs of fixed diameter
• Two-player pebbling on diameter 2 graphs
• t-pebbling the graphs of diameter two
• Pebbling and optimal pebbling in graphs
• Graph pebbling algorithms and Lemke graphs
• Optimal pebbling and rubbling of graphs with given diameter
• scientific article; zbMATH DE number 3952825
• The Complexity of Graph Pebbling
• A note on graph pebbling

Cited in

(10)

• Two dynamic programming algorithms for which interpreted pebbling helps
• The weight function lemma for graph pebbling
• Graph pebbling algorithms and Lemke graphs
• The complexity of pebbling reachability and solvability in planar and outerplanar graphs
• Pebbling in Split Graphs
• A Graph Pebbling Algorithm on Weighted Graphs
• t-pebbling and extensions
• The complexity of pebbling in diameter two graphs
• Pebbling in semi-2-trees
• Automating weight function generation in graph pebbling

This page was built for publication: Pebbling Algorithms in Diameter Two Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563930)