| Автор | Karmakar, Sudhangshu B. |
| Дата выпуска | 1987 |
| dc.description | AbstractA heuristic methodology for the identification of a circuit passing through all the vertices only once in a graph is presented. The procedure is based upon defining a normal form of a matrix and then transforming the adjacency matrix into its normal form. For a class of graphs known to be Hamiltonian, it is conjectured that this methodology will identify circuits in a small number of steps and in many cases merely by observation. |
| Формат | application.pdf |
| Издатель | Cambridge University Press |
| Копирайт | Copyright © Australian Mathematical Society 1987 |
| Название | A heuristic method for the determination of a Hamiltonian circuit in a graph |
| Тип | research-article |
| DOI | 10.1017/S0334270000005439 |
| Electronic ISSN | 1446-8735 |
| Print ISSN | 0334-2700 |
| Журнал | The Journal of the Australian Mathematical Society. Series B. Applied Mathematics |
| Том | 28 |
| Первая страница | 328 |
| Последняя страница | 339 |
| Аффилиация | Karmakar Sudhangshu B.; Bell Communications Research, Piscataway, NJ 08854, USA. |
| Выпуск | 3 |
