A new algorithm for minimum spanning tree using depth-first-search in an undirected graph

DOI10.1080/00207169508804419zbMath0847.68082OpenAlexW2014239591MaRDI QIDQ4876371

No author found.

Publication date: 1 May 1996

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804419

zbMATH Keywords

minimum spanning tree

Mathematics Subject Classification ID

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

Related Items (2)

A linear time algorithm for finding depth-first spanning trees on trapezoid graphs ⋮ Parallel Algorithms for Minimum Spanning Tree Problem

Cites Work

• On Linear Time Minor Tests with Depth-First Search
• Unnamed Item

This page was built for publication: A new algorithm for minimum spanning tree using depth-first-search in an undirected graph