Vertex isoperimetric parameter of a computation graph

DOI10.1142/S0129054112500128MaRDI QIDQ4902887zbMATHOpenAlexFDO

Authors 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

lower boundsdirected graphcomplete solutionboundary vertexcomputation graphsbinomial graphinput vertexmemory trafficoutput vertexvertex isoperimetric parameter

Mathematics Subject Classification ID

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

Recommendations

• Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
• Lower bounding the boundary of a graph in terms of its maximum or minimum degree
• scientific article; zbMATH DE number 1929307
• A new upper bound for the isoperimetric number of de Bruijn networks
• Computing the isoperimetric number of a graph

Cites work

• scientific article; zbMATH DE number 1033441 (Why is no real title available?)
• scientific article; zbMATH DE number 1051049 (Why is no real title available?)
• scientific article; zbMATH DE number 1820639 (Why is no real title available?)
• An Isoperimetric Problem on a Lattice
• Discrete Isoperimetric Problems
• Edge isoperimetric theorems for integer point arrays
• Edge-isoperimetric inequalities in the grid
• Expander graphs and their applications
• On isoperimetrically optimal polyforms
• Option pricing: A simplified approach
• Pentagon-hexagon-patches with short boundaries
• The isoperimetric number of \(d\)-dimensional \(k\)-ary arrays
• The vertex isoperimetric problem for the powers of the diamond graph

This page was built for publication: Vertex isoperimetric parameter of a computation graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902887)