Dynamic study of the graphs KNN and KMST

MaRDI QIDQ1331161zbMATH OpenFDO

Authors Vito Di Gesù

Publication date 14 August 1994

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

K-minimum spanning treeK-nearest neighbour

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Successive minimum spanning trees
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• Minimum spanning trees in networks with varying edge weights
• Maximal paths in random dynamic graphs

This page was built for publication: Dynamic study of the graphs KNN and KMST

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