THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
From MaRDI portal
Publication:5249005
DOI10.1142/S0129054199000216zbMath1320.05063OpenAlexW2066568745MaRDI QIDQ5249005
Ömer Eğecioğlu, M. Cemil Azizoğlu
Publication date: 29 April 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054199000216
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
The bisection width and the isoperimetric number of arrays. ⋮ LINEAR LAYOUT OF GENERALIZED HYPERCUBES ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Eliminating cycles in the discrete torus ⋮ Unnamed Item
Cites Work
- Edge-isoperimetric inequalities in the grid
- Edge isoperimetric theorems for integer point arrays
- Discrete Isoperimetric Problems
- Isoperimetric Inequalities for Cartesian Products of Graphs
- An Ordering on the Even Discrete Torus
- An Isoperimetric Inequality on the Discrete Torus
- Optimal Assignments of Numbers to Vertices
This page was built for publication: THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
