Linear layouts of generalized hypercubes
From MaRDI portal
Publication:6184632
DOI10.1007/3-540-57899-4_66zbMATH Open1528.68315OpenAlexW1601061442MaRDI QIDQ6184632FDOQ6184632
Authors: Koji Nakano
Publication date: 5 January 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-57899-4_66
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cites Work
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Optimal Assignments of Numbers to Vertices
- Title not available (Why is that?)
- On minimizing width in linear layouts
- Preserving Proximity in Arrays
- Preserving average proximity in arrays
- Elevation of a graph
Cited In (2)
This page was built for publication: Linear layouts of generalized hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184632)