𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A limitation of the Kumaresan-Prony algorithm in direction-finding applications

✍ Scribed by Bacon, L.; Post, R.

Book ID
117906107
Publisher
IEEE
Year
1984
Weight
397 KB
Volume
32
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Faster Algorithm for Finding the Minim
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
✍ J.X. Hao; J.B. Orlin πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

A comparison of three algorithms for fin
A comparison of three algorithms for finding fundamental cycles in a directed graph
✍ Doris R. Ryan; Stephen Chen πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 543 KB

## Abstract Given a connected directed graph and a spanning tree, we consider the problem of finding the set of fundamental cycles. In particular, for each cotree arc __i__ and tree arc __j__, we need to know whether or not __i__ and __j__ are in the same fundamental cycle, and if so, whether or no