Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths
From MaRDI portal
Publication:2781091
DOI10.1287/opre.46.3.293zbMath0987.90530OpenAlexW2058946929WikidataQ56341773 ScholiaQ56341773MaRDI QIDQ2781091
Roman Arbiol, Elena Fernández, Robert Garfinkel
Publication date: 18 March 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.46.3.293
Related Items
Quadratic bottleneck problems ⋮ Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. ⋮ Bottleneck flows in unit capacity networks ⋮ Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems