In the combinatorial problem considered, the functional graph was proved to be asymptotically optimal over all directed paths in one case, and exactly optimal over directed trees in another case.
|Title of host publication||Notes and Reports in Computer Science and Applied Mathematics|
|Number of pages||24|
|State||Published - 1983|
ASJC Scopus subject areas
- Engineering (all)