Controllable connector (Q2639834): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 08:56, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Controllable connector |
scientific article |
Statements
Controllable connector (English)
0 references
1990
0 references
The short communication, legible only for those familiar with the problems of non-blocking networks, is closely connected to two previous papers of the authors and mainly to the paper by Feldman, Friedman and Pippenger (c.f. below) who introduced the concept of controllable connector. The present paper introduces a new sufficient condition for a graph to be a controllable concentrator which weakens the condition from [\textit{P. Feldman}, \textit{J. Friedman} and \textit{N. Pippenger}, J. Assoc. Comput. Mach. 33, 247-254 (1986)].
0 references
non-blocking networks
0 references
controllable connector
0 references
controllable concentrator
0 references