Optimal arrangement of data in a tree directory

DOI10.1016/S0166-218X(01)00174-3MaRDI QIDQ5951966zbMATH OpenOpenAlexFDO

Authors Malwina Luczak, Steven D. Noble

Publication date 2001

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0166-218x(01)00174-3

zbMATH Keywords

ComplexityGraph embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Heuristics for the data arrangement problem on regular trees
• scientific article; zbMATH DE number 3945345
• On optimal linear arrangements of trees
• Linear arrangement problems on recursively partitioned graphs
• On the complexity of tree embedding problems

Cites work

• scientific article; zbMATH DE number 193142 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Complexity Results for Bandwidth Minimization
• On embedding graphs in trees
• On optimal linear arrangements of trees
• Optimal Assignments of Numbers to Vertices
• Some simplified NP-complete graph problems

Cited in

(2)

• scientific article; zbMATH DE number 3945345 (Why is no real title available?)
• Heuristics for the data arrangement problem on regular trees

This page was built for publication: Optimal arrangement of data in a tree directory

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