Cost Trade-offs in Graph Embeddings, with Applications
From MaRDI portal
Publication:3763589
DOI10.1145/2157.322401zbMath0627.68038OpenAlexW2153017573MaRDI QIDQ3763589
Jia-Wei Hong, Arnold L. Rosenberg, Kurt Mehlhorn
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/344635
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
On embedding graphs in trees ⋮ Optimal dynamic embedding of X-trees into arrays ⋮ Minced trees, with applications to fault-tolerant VLSI processor arrays ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Recognizing binary Hamming graphs inO(n 2 logn) time ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Embeddings on a Boolean cube ⋮ A variation on the min cut linear arrangement problem ⋮ Hypercube embedding heuristics: An evaluation ⋮ On the complexity of tree embedding problems ⋮ Perfect Storage Representations for Families of Data Structures ⋮ A MIMD implementation of a parallel Euler solver for unstructured grids ⋮ Optimal embeddings of butterfly-like graphs in the hypercube ⋮ On efficient entreeings ⋮ Directed virtual path layouts in ATM networks
