scientific article; zbMATH DE number 4035176

MaRDI QIDQ3774973zbMATH OpenFDO

Authors P. V. Denisovich

Publication date 1986

zbMATH Keywords

cell automatongraphincidence matrixshortest distancestransitive closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Computing shortest paths with cellular automata
• scientific article; zbMATH DE number 4201626
• Computing transitive closure on systolic arrays of fixed size
• scientific article; zbMATH DE number 4092728
• A cellular automaton that computes shortest paths in grid graph

Cited in

(7)

• scientific article; zbMATH DE number 4201626 (Why is no real title available?)
• scientific article; zbMATH DE number 4092728 (Why is no real title available?)
• Algorithms for weighted graph problems on the modified cellular graph automaton
• scientific article; zbMATH DE number 1941144 (Why is no real title available?)
• Computing shortest paths with cellular automata
• Numerical Analysis and Its Applications
• A cellular automaton that computes shortest paths in grid graph

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