scientific article; zbMATH DE number 3945345

zbMATH Open0588.68019MaRDI QIDQ3716296FDOQ3716296

Authors: Burkhard Monien 

Publication date: 1985

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

Recommendations

• On the complexity of tree embedding problems
• Optimal arrangement of data in a tree directory
• Optimal embedding of complete binary trees into lines and grids
• scientific article; zbMATH DE number 219230
• Unit-length embedding of binary trees on a square grid

zbMATH Keywords

NP-completenessouterplanar graphsembedding graphs into binary trees

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (9)

• Embedding an arbitrary binary tree into the star graph
• Communication tree problems
• Embedding meshes of trees into deBruijn graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• The parallel complexity of tree embedding problems (extended abstract)
• Minimal storage representations for binary relations
• The nonexistence of reduction rules giving an embedding into a \(k\)-tree
• Optimal arrangement of data in a tree directory

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