A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles (Q2413355)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6857633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of biconnected graphs reachable by robots jumping over \(m\) obstacles |
scientific article; zbMATH DE number 6857633 |
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
0.84847665
0 references
0.82515734
0 references
0.82403016
0 references
0.8196107
0 references
0.80642587
0 references
0.80175745
0 references
