scientific article; zbMATH DE number 4047157

zbMATH Open0642.68129MaRDI QIDQ3783602FDOQ3783602

Authors: M. A. Iordanskij 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

• A tree labeling problem with an application to optimal approximation of continuous functions
• Bounds of the sum of edge lengths in linear arrangements of trees
• Minimum projective linearizations of trees in linear time
• Title not available (Why is that?)
• A typical vertex of a tree
• The maximum linear arrangement problem for trees under projectivity and planarity
• Title not available (Why is that?)
• On the minimum number of components in a cotree of a graph
• Assigning bookmarks in perfect binary trees.

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)