A cellular automaton that computes shortest paths in grid graph

DOI10.1007/978-3-030-69480-7_1zbMATH Open1489.68145OpenAlexW3133394124MaRDI QIDQ831670FDOQ831670

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

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

zbMATH Keywords

shortest pathscellular automatagrid graph

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• A lower bound on complexity of a locator cellular automaton solution for the closest neighbor search problem
• A novel method for solving the monophyletic shortest path problem based on cellular automata
• A Maze Routing Algorithm Based on Two Dimensional Cellular Automata
• Computing shortest paths with cellular automata
• Algorithms for weighted graph problems on the modified cellular graph automaton

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)