The Shortest Connected Graph Through Dynamic Programming Technique

DOI10.2307/2689138MaRDI QIDQ5552100zbMATH OpenOpenAlexFDO

Authors R. C. Garg, Sameer Kumar

Publication date 1968

Full work available at URL https://doi.org/10.2307/2689138

zbMATH Keywords

topology

Cited in

(1)

• A minimum spanning tree based heuristic for the travelling salesman tour

This page was built for publication: The Shortest Connected Graph Through Dynamic Programming Technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5552100)