scientific article; zbMATH DE number 4198042

MaRDI QIDQ3348012zbMATH OpenFDO

Authors V. I. Miroshnichenko

Publication date 1989

Full work available at URL https://eudml.org/doc/51513

zbMATH Keywords

algorithmminimal total length of edgestree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 3891405
• scientific article; zbMATH DE number 3846542
• scientific article; zbMATH DE number 1094324
• scientific article; zbMATH DE number 4010557
• A distance approximating trees

Cited in

(5)

• Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices
• On defect sets in bipartite graphs (extended abstract)
• scientific article; zbMATH DE number 910707 (Why is no real title available?)
• Sets admitting connection by graphs of finite length
• Constructing a minimum height elimination tree of a tree in linear time

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 Q3348012)