✦ LIBER ✦

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

✍ Scribed by Belishev, M. I.; Vakulenko, A. F.

Book ID: 120106258
Publisher: Walter de Gruyter GmbH & Co. KG
Year: 2006
Tongue: English
Weight: 253 KB
Volume: 14
Category: Article
ISSN: 0928-0219
DOI: 10.1163/156939406776237474

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boundary spectral inverse problem on a c

Boundary spectral inverse problem on a class of graphs (trees) by the BC method

✍ Belishev, M I 📂 Article 📅 2004 🏛 Institute of Physics 🌐 English ⚖ 322 KB

Boundary control and inverse problems: T

Boundary control and inverse problems: The one-dimensional variant of the BC-method

✍ M. I. Belishev 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 560 KB

Inverse problem of determining absorptio

Inverse problem of determining absorption coefficient in the wave equation by BC method

✍ Pestov, Leonid 📂 Article 📅 2012 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 193 KB

ON THE INVERSE PROBLEM OF THE VIBRATING

ON THE INVERSE PROBLEM OF THE VIBRATING STRING OR ROD

✍ GLADWELL, G. M. L.; GBADEYAN, J. A. 📂 Article 📅 1985 🏛 Oxford University Press 🌐 English ⚖ 194 KB

On the complexity of graph tree partitio

On the complexity of graph tree partition problems

✍ Roberto Cordone; Francesco Maffioli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati

On the graph for which there is a tree a

On the graph for which there is a tree as the inverse interchange graph of a local graph

✍ Juhani Nieminen 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 347 KB