Vertex isoperimetric parameter of a computation graph

DOI10.1142/S0129054112500128zbMATH Open1254.05070OpenAlexW2165731524MaRDI QIDQ4902887FDOQ4902887

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

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

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)

Cites Work

• Expander graphs and their applications
• Option pricing: A simplified approach
• Edge-isoperimetric inequalities in the grid
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Isoperimetric Problem on a Lattice
• Title not available (Why is that?)
• Pentagon-hexagon-patches with short boundaries
• The vertex isoperimetric problem for the powers of the diamond graph
• Edge isoperimetric theorems for integer point arrays
• Discrete Isoperimetric Problems
• On isoperimetrically optimal polyforms
• THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS

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)