scientific article; zbMATH DE number 4189511

MaRDI QIDQ5753770zbMATH OpenFDO

Authors Wojciech Rytter

Publication date 1987

zbMATH Keywords

pebble gamessurvey

Mathematics Subject Classification ID

Distributed algorithms (68W15) Abstract computational complexity for mathematical programming problems (90C60) Games involving graphs (91A43)

Recommendations

• Pebble game algorithms and sparse graphs
• Pebble games and cospectral graphs
• Pebble game algorithms and (k,l)-sparse graphs
• A note on graph pebbling
• Inapproximability of the standard pebble game and hard to pebble graphs
• scientific article; zbMATH DE number 2024632
• Sparse hypergraphs and pebble game algorithms
• Games on graphs
• Characterizing winning positions in the impartial two-player pebbling game on complete graphs

Cited in

(11)

• Sparse hypergraphs and pebble game algorithms
• On efficient parallel computations for some dynamic programming problems
• An infinite pebble game and applications
• Optimal parallel algorithms for dynamic expression evaluation and context-free recognition
• Inapproximability of the standard pebble game and hard to pebble graphs
• Pebble games, proof complexity, and time-space trade-offs
• Pebble games over ordered structural abstractions
• PEBBLE GAMES AND LINEAR EQUATIONS
• A New Pebble Game that Characterizes Parallel Complexity Classes
• The Scholten/Dijkstra Pebble Game Played Straightly, Distributedly, Online and Reversed
• Parallel algorithms for a class of graphs generated recursively

This page was built for publication:

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