A note on top down and bottom up analysis of strongly connected digraphs
✍ Scribed by G. Chaty; M. Chein
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 124 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Changing Knuth's notation slightly we construct a set of strongly connected digraphs which is equal to the set of the compound circuits defined by Luce. (Let us recall that Luce proved that a minimal strongly connected digraph is a compound circuit.)
📜 SIMILAR VOLUMES
**Several strategies are demonstrated** for the use of additive‐driven chemistries that take place in only one type of the nanosized domains of all‐organic and organic–inorganic hybrid block copolymer thin films. Such an approach is used to examine the convergence of “top–down” and “bottom–up” fabri