A cellular automaton that computes shortest paths in grid graph

DOI10.1007/978-3-030-69480-7_1MaRDI QIDQ831670zbMATH OpenOpenAlexFDO

Authors Debopriya Barman, Sukanta Das

Publication date 24 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-69480-7_1

zbMATH Keywords

shortest pathscellular automatagrid graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Recommendations

• Computing shortest paths with cellular automata
• Computation of shortest path in cellular automata
• A novel method for solving the monophyletic shortest path problem based on cellular automata
• CELLULAR AUTOMATA AND OPTIMAL PATH PLANNING
• scientific article; zbMATH DE number 4035176

Cited in

(6)

• A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
• scientific article; zbMATH DE number 4035176 (Why is no real title available?)
• A lower bound on complexity of a locator cellular automaton solution for the closest neighbor search problem
• Computing shortest paths with cellular automata
• Algorithms for weighted graph problems on the modified cellular graph automaton
• A novel method for solving the monophyletic shortest path problem based on cellular automata

This page was built for publication: A cellular automaton that computes shortest paths in grid graph

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