VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH
From MaRDI portal
Publication:4902887
DOI10.1142/S0129054112500128zbMath1254.05070MaRDI QIDQ4902887
Publication date: 18 January 2013
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054112500128
directed graph; lower bounds; complete solution; boundary vertex; computation graphs; binomial graph; input vertex; memory traffic; output vertex; vertex isoperimetric parameter
Cites Work
- On isoperimetrically optimal polyforms
- Edge-isoperimetric inequalities in the grid
- Pentagon-hexagon-patches with short boundaries
- Edge isoperimetric theorems for integer point arrays
- The vertex isoperimetric problem for the powers of the diamond graph
- Expander graphs and their applications
- Discrete Isoperimetric Problems
- An Isoperimetric Problem on a Lattice
- THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
- Option pricing: A simplified approach
- Unnamed Item
- Unnamed Item
- Unnamed Item