Efficient lower and upper bounds of the diagonal-flip distance between triangulations
type: Item
instance of: scholarly article
title: Efficient lower and upper bounds of the diagonal-flip distance between triangulations
zbMATH Open document ID: 1185.68845
author: Jean-Luc Baril
author: Jean Pallo
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5664705
zbMATH Keywords: triangulations
zbMATH Keywords: diagonal-flip distance
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.07.001
OpenAlex ID: W2148845695
cites work: Restricted rotation distance between binary trees.
cites work: Bounding restricted rotation distance
cites work: An efficient algorithm for estimating rotation distance between two binary trees
cites work: A note on some tree similarity measures
cites work: Q4942049
cites work: A direct algorithm for restricted rotation distance
cites work: On the upper bound on the rotation distance of binary trees
cites work: Enumerating, Ranking and Unranking Binary Trees
cites work: An efficient upper bound of the rotation distance of binary trees
cites work: Right-arm rotation distance between binary trees
cites work: Q4393275
cites work: Q4949795
cites work: Algorithms and Data Structures
cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry
DOI: 10.1016/J.IPL.2006.07.001
description: scientific article; zbMATH DE number 5664705