Motion planning in Cartesian product graphs

DOI10.7151/dmgt.1726zbMath1290.05125OpenAlexW2075695489MaRDI QIDQ2450121

Kalpesh Kapoor, Biswajit Deb

Publication date: 16 May 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1726

zbMATH Keywords

Cartesian product of graphsrobot motion in a graph

Mathematics Subject Classification ID

Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Artificial intelligence for robotics (68T40) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The outer-connected vertex edge domination number in Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((n^ 2-1)\)-puzzle and related relocation problems
• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• Graph puzzles, homotopy, and the alternating group
• Stable networks and product graphs
• ON mRJ REACHABILITY IN TREES
• Reconfigurations in Graphs and Grids

This page was built for publication: Motion planning in Cartesian product graphs