On a proposed divide-and-conquer minimal spanning tree algorithm

I. Stojmenović; M. Langston

Results

eNauka > Results > On a proposed divide-and-conquer minimal spanning tree algorithm

Title:	On a proposed divide-and-conquer minimal spanning tree algorithm
Authors:	I. Stojmenović; M. Langston
Issue Date:	1988
Publication:	BIT NUMERICAL MATHEMATICS
ISSN:	0006-3835 Bit Numerical Mathematics Search Idenfier
Type:	Article
Collation:	vol. 28 str. 785-791
URI:	http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/2/2122 https://enauka.gov.rs/handle/123456789/710888
M-category:	22M22

Find the DOI

Finding a DOI in CrossRef based on publication meta-data. The DOI (and metadata) with the similar data match will be displayed. ATTENTION - it doesn't have to be that publication.