Optimal arrangement of data in a tree directory

DOI10.1016/S0166-218X(01)00174-3zbMath1001.68088OpenAlexW4212827039MaRDI QIDQ5951966

Malwina J. 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On optimal linear arrangements of trees
• On embedding graphs in trees
• Some simplified NP-complete graph problems
• Complexity Results for Bandwidth Minimization
• A Minimum Linear Arrangement Algorithm for Undirected Trees
• Optimal Assignments of Numbers to Vertices

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