Cost Trade-offs in Graph Embeddings, with Applications
From MaRDI portal
Publication:3763589
DOI10.1145/2157.322401zbMATH Open0627.68038OpenAlexW2153017573MaRDI QIDQ3763589FDOQ3763589
Authors: Jia-Wei Hong, K. Mehlhorn, Arnold L. Rosenberg 
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://edoc.mpg.de/344635
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (18)
- Scheduling task-trees with additive scales on parallel/distributed machines
- A MIMD implementation of a parallel Euler solver for unstructured grids
- Optimal dynamic embedding of X-trees into arrays
- Recognizing binary Hamming graphs inO(n 2 logn) time
- Scheduling task-tree with additive scales on parallel/distributed machines
- Optimal embeddings of butterfly-like graphs in the hypercube
- Title not available (Why is that?)
- Salvage-Embeddings of Complete Trees
- Perfect Storage Representations for Families of Data Structures
- Embedding of \(K_r+K^c_s\) and \(K_r+P_s\) into arbitrary trees
- On efficient entreeings
- Directed virtual path layouts in ATM networks
- On embedding graphs in trees
- Embeddings on a Boolean cube
- Minced trees, with applications to fault-tolerant VLSI processor arrays
- On the complexity of tree embedding problems
- A variation on the min cut linear arrangement problem
- Hypercube embedding heuristics: An evaluation
This page was built for publication: Cost Trade-offs in Graph Embeddings, with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763589)
