Vertex isoperimetric parameter of a computation graph (Q4902887)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6126733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Vertex isoperimetric parameter of a computation graph |
scientific article; zbMATH DE number 6126733 |
Statements
VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH (English)
0 references
18 January 2013
0 references
directed graph
0 references
vertex isoperimetric parameter
0 references
computation graphs
0 references
binomial graph
0 references
memory traffic
0 references
lower bounds
0 references
complete solution
0 references
input vertex
0 references
output vertex
0 references
boundary vertex
0 references
0.7003507614135742
0 references
0.6500130891799927
0 references
0.6412069797515869
0 references
0.6412068605422974
0 references
