Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 57, 1995 - Issue 3-4
Submit an article Journal homepage
78
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

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

H. Salehi-Fathabadi Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran
&
H. Ahrabian Department of Mathematics and Computer Science, Faculty of Science University of Tehran, Tehran, 14174, Iran
Pages 157-161 | Received 11 Jan 1994, Published online: 19 Mar 2007

Citations (4)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (1)

H. Ahrabian & A. Nowzari-Dalini. (2002) Parallel Algorithms for Minimum Spanning Tree Problem. International Journal of Computer Mathematics 79:4, pages 441-448.
Read now

Articles from other publishers (3)

Marco Cesar Goldbarg, Henrique Pacca Loureiro Luna & Elizabeth Ferreira Gouvêa Goldbarg. 2015. Programação Linear e Fluxos em Redes. Programação Linear e Fluxos em Redes 265 314 .
Sukumar Mondal, Madhumangal Pal & Tapan K. Pal. (1999) An optimal algorithm for finding depth-first spanning tree on permutation graphs. Korean Journal of Computational & Applied Mathematics 6:3, pages 493-500.
Crossref
Hon-Chan Chen & Yue-Li Wang. (1997) A linear time algorithm for finding depth-first spanning trees on trapezoid graphs. Information Processing Letters 63:1, pages 13-18.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.