Cost Trade-offs in Graph Embeddings, with Applications
From MaRDI portal
Publication:3763589
Recommendations
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
- scientific article; zbMATH DE number 139790 (Why is no real title available?)
- Salvage-Embeddings of Complete Trees
- Perfect Storage Representations for Families of Data Structures
- On efficient entreeings
- Directed virtual path layouts in ATM networks
- On embedding graphs in trees
- Embeddings on a Boolean cube
- Embedding of \(K_r+K^c_s\) and \(K_r+P_s\) into arbitrary trees
- On the complexity of tree embedding problems
- Minced trees, with applications to fault-tolerant VLSI processor arrays
- Hypercube embedding heuristics: An evaluation
- A variation on the min cut linear arrangement problem
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)
