VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH

DOI10.1142/S0129054112500128zbMath1254.05070OpenAlexW2165731524MaRDI QIDQ4902887

Desh Ranjan, Mohammad Zubair

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

zbMATH Keywords

directed graphlower boundscomplete solutionboundary vertexcomputation graphsbinomial graphinput vertexmemory trafficoutput vertexvertex isoperimetric parameter

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH