scientific article; zbMATH DE number 4156450

MaRDI QIDQ3484845zbMATH OpenFDO

Authors Michael L. Gargano, Sylvia C. Friederich

Publication date 1990

zbMATH Keywords

constructing a minimum cost sequential spanning tree of a graph

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• scientific article; zbMATH DE number 3891405
• Cost of sequential connection for points in space
• The problem of the optimal biobjective spanning tree
• Spanning Trees and Optimization Problems
• Contractors' minimum spanning tree

Cited in

(5)

• On finding most uniform spanning trees
• Efficient Chaining of Seeds in Ordered Trees
• scientific article; zbMATH DE number 3858819 (Why is no real title available?)
• scientific article; zbMATH DE number 7267318 (Why is no real title available?)
• Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms

This page was built for publication:

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