scientific article; zbMATH DE number 4047157

MaRDI QIDQ3783602zbMATH OpenFDO

Authors M. A. Iordanskij

Publication date 1987

zbMATH Keywords

algorithmvertices of trees

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 15358
• scientific article; zbMATH DE number 3891405
• A distance approximating trees
• On optimal linear arrangements of trees
• scientific article; zbMATH DE number 890671

Cited in

(10)

• A typical vertex of a tree
• Minimum projective linearizations of trees in linear time
• A tree labeling problem with an application to optimal approximation of continuous functions
• On the minimum number of components in a cotree of a graph
• scientific article; zbMATH DE number 15358 (Why is no real title available?)
• Assigning bookmarks in perfect binary trees.
• scientific article; zbMATH DE number 6469175 (Why is no real title available?)
• Bounds of the sum of edge lengths in linear arrangements of trees
• The maximum linear arrangement problem for trees under projectivity and planarity
• Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs

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