The inverse 1-maxian problem with edge length modification
β Scribed by Elisabeth Gassner
- Publisher
- Springer US
- Year
- 2007
- Tongue
- English
- Weight
- 378 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1382-6905
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph __D__ = (__V__, __A__), the task is to find positive integer arc lengths such that th
## Abstract The uniqueness of determination of a polyhedron homeomorphic to a bali by its edge graph is proved in the most general situation. Consequences are given that arise from this result in the inverse potential problem. Unsolved problems are formulated.