| 000 | 00746nam a2200265Ia 4500 | ||
|---|---|---|---|
| 003 | OSt | ||
| 005 | 20220912144839.0 | ||
| 006 | a|||||r|||| 00| 0 | ||
| 007 | ta | ||
| 008 | 220909b |||||||| |||| 00| 0 eng d | ||
| 024 | _a67790 | ||
| 037 | _cTextual | ||
| 040 |
_aCSL _beng _cCSL |
||
| 041 | _aeng | ||
| 082 | _aD65,8(B):(B257), M7 | ||
| 100 | _aAkman Varol | ||
| 245 | 0 | _aUnobstructed shortest paths in polyhedral environments | |
| 260 |
_aBerlin _bSpringer Verlag _c1987 |
||
| 300 |
_a103p. _ccm. |
||
| 490 | _aLecture noter in computer science; 251 | ||
| 500 | _aBibliography 93-103p. | ||
| 650 | _aComputer science | ||
| 942 |
_hD65,8(B):(B257), M7 _cTEXL _2CC |
||
| 999 |
_c17114 _d17114 |
||