Integer-programming bounds on pebbling numbers of Cartesian-product graphs

DOI10.1007/978-3-030-04651-4_46MaRDI QIDQ2327149zbMATH OpenOpenAlexFDO

Authors Franklin Kenter, Daphne Skipper

Publication date 11 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-04651-4_46

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Bounds for the pebbling number of product graphs
• Computing bounds on product graph pebbling numbers
• Optimal pebbling in products of graphs
• Pebbling numbers of the Cartesian product of cycles and graphs
• A note on pebbling bound for a product of class 0 graphs
• Cover pebbling number of some product graphs
• The t-pebbling number of graphs
• The binding numbers of some Cartesian products of graphs
• Integer domination of Cartesian product graphs
• Graham's pebbling conjecture on product of complete bipartite graphs

Cited in

(11)

• On properties of pebble assignment graphs
• Computing bounds on product graph pebbling numbers
• Cycles and girth in pebble assignment graphs
• Pebbling on graph products and other binary graph constructions
• A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
• A computational status update for exact rational mixed integer programming
• A computational status update for exact rational mixed integer programming
• scientific article; zbMATH DE number 7709890 (Why is no real title available?)
• Safe and Verified Gomory Mixed-Integer Cuts in a Rational Mixed-Integer Program Framework
• Automating weight function generation in graph pebbling
• Satisfiability modulo theories for verifying MILP certificates

This page was built for publication: Integer-programming bounds on pebbling numbers of Cartesian-product graphs

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