A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.endm.2017.11.012 / rank | |||
| Property / cites work | |||
| Property / cites work: A Modern Treatment of the 15 Puzzle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON <i>mRJ</i> REACHABILITY IN TREES / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Complete S-Reachable Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preemptive Ensemble Motion Planning on a Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph puzzles, homotopy, and the alternating group / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ENDM.2017.11.012 / rank | |||
Normal rank | |||
Latest revision as of 12:55, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles |
scientific article |
Statements
A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (English)
0 references
10 April 2018
0 references
bi-connected graphs
0 references
\( mRJ\)-moves
0 references
\( mRJ\)-reachability
0 references
