Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 167884

From MaRDI portal
Publication:4034699
Jump to:navigation, search

zbMATH Open0787.68044MaRDI QIDQ4034699FDOQ4034699


Authors: Mathias Bull, Armin Hemmerling Edit this on Wikidata


Publication date: 16 May 1993



Title of this publication is not available (Why is that?)



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


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)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4034699&oldid=17754470"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 02:59. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki