The minimum spanning tree with node index ≤ 2 is equivalent to the minimum travelling salesman tour

Kumar, Santosh; Munapo, Elias; Sigauke, Caston; Al-Rabeeah, Masar Ismael Mohammed

The minimum spanning tree with node index ≤ 2 is equivalent to the minimum travelling salesman tour

https://hdl.handle.net/10779/rmit.27414858

chapter

posted on 2024-11-01, 02:07 authored by Santosh KumarSantosh Kumar, Elias Munapo, Caston Sigauke, Masar Ismael Mohammed Al-Rabeeah

No description available

History

Related Materials

1.
ISBN - Is published in 9781351266314 (urn:isbn:9781351266314)
2.
URL - Is published in https://trove.nla.gov.au/work/236856574?keyword=9781351266314

Start page

227

End page

244

Total pages

18

Outlet

Mathematics in Engineering Sciences

Editors

Mangey Ram

Publisher

CRC Press

Place published

Boca Raton, United States

Language

English

Copyright

Former Identifier

2006118093

Esploro creation date

2022-11-23

Usage metrics

Keywords

Not Assigned

The minimum spanning tree with node index ≤ 2 is equivalent to the minimum travelling salesman tour

History

Related Materials

Start page

End page

Total pages

Outlet

Editors

Publisher

Place published

Language

Copyright

Former Identifier

Esploro creation date

Usage metrics

Categories

Keywords

Licence

Exports