The Minimal Number of Layers of a Perceptron That Sorts
β Scribed by P.J. Zwietering; E.H.L. Aarts; J. Wessels
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 582 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A graph __g__ of diameter 2 is minimal if the deletion of any edge increases its diameter. Here the following conjecture of Murty and Simon is proved for __n__ < __n__~o~. If __g__ has __n__ vertices then it has at most __n__^2^/4 edges. The only extremum is the complete bipartite graph
I 6 . 12 G . B . D a n t z i g and D. R . F u l k e r s o n The Hand C o r p o r a t i o n ## I It is shown that the problem of determining the minimum number of tankers required to meet a fixed schedule of transportation of Navy fuel oil can be made into a linear programming problem of the t r a