Inverse problems on graphs: recovering the tree of strings by the BC-method

By Mikhail I. Belishev, A. Vakulenko. 2006

74 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/f8d82199b3f86af7bba0ac9a08d8793ae71853e6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Peter Kuchment
2. Mikhail I. Belishev
3. Matti Lassas
4. Lauri Oksanen

In Mathematical Physics

1. Peter Kuchment
2. Mikhail I. Belishev
3. Pavel Kurasov
4. Konstantin Pankrashkin
5. Matti Lassas
6. Vjacheslav A. Yurko
7. Lauri Oksanen
8. Nicolas Popoff

Citations in the corpus

• Recent progress in the boundary control method (2007, methodology): “The proof is based on analysis of the boundary controllability of trees: see [27] and [54].”
• Homogeneous trees of second order Sturm-Liouville equations: A general theory and program (2008, background): “See also [17, 18, 45, 97, 152, 187, 214] for the control theory approach and other discussions of the inverse problem.”