The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs

MaRDI QIDQ4986515zbMATH OpenFDO

Authors Felix Canavoi, Erich Grädel, Roman Rabinovich

Publication date 27 April 2021

Full work available at URL http://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2012.15

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• scientific article; zbMATH DE number 1670778
• The complexity of all-switches strategy improvement
• scientific article; zbMATH DE number 1962853
• The complexity of all-switches strategy improvement

Cited in

(5)

• A superpolynomial lower bound for strategy iteration based on snare memorization
• The complexity of all-switches strategy improvement
• The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
• scientific article; zbMATH DE number 1670778 (Why is no real title available?)
• The complexity of all-switches strategy improvement

This page was built for publication: The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs

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