Euclidean Distance Approximations From Replacement Product Graphs
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Image Processing"
DOI: 10.1109/tip.2021.3128319
Abstract: We introduce a new chamfering paradigm, locally connecting pixels to produce path distances that approximate Euclidean space by building a small network (a replacement product) inside each pixel. These “ $RE$ -grid graphs” maintain near-Euclidean… read more here.
Keywords: inline formula; tex math; replacement product; replacement ... See more keywords
On 3-Restricted Edge Connectivity of Replacement Product Graphs
Sign Up to like & getrecommendations! Published in 2023 at "Axioms"
DOI: 10.3390/axioms12050504
Abstract: A 3-restricted edge cut is an edge cut of a connected graph that separates this graph into components, each having an order of at least 3. The minimum size of all 3-restricted edge cuts of… read more here.
Keywords: restricted edge; product graphs; edge connectivity; graphs ... See more keywords