scientific article; zbMATH DE number 167884

MaRDI QIDQ4034699zbMATH OpenFDO

Authors Mathias Bull, Armin Hemmerling

Publication date 16 May 1993

zbMATH Keywords

connected graphscomplexity of searchinglabyrinth theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3846876
• scientific article; zbMATH DE number 647638
• Reduction of automata in labyrinths and universal traps
• scientific article; zbMATH DE number 4037204
• Publication:3468613

Cited in

(1)

• Reachability and the power of local ordering

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 Q4034699)