Transforming spanning trees and pseudo-triangulations

DOI10.1016/J.IPL.2005.09.003MaRDI QIDQ1044747zbMATH OpenOpenAlexWikidataFDO

Authors Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser

Publication date 18 December 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2005.09.003

zbMATH Keywords

computational geometryflipping distancepseudo-triangulationsspanning trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Transforming spanning trees: A lower bound
• scientific article; zbMATH DE number 2188327
• Transforming pseudo-triangulations
• scientific article; zbMATH DE number 2009873
• scientific article; zbMATH DE number 3948324
• Spanning trees in locally planar triangulations
• Spanning triangulations in graphs
• Spanning triangle-trees and flows of graphs
• Spanning trees in hyperbolic graphs
• Spanning tree enumeration and nearly triangular graph Laplacians

Cites work

• A quadratic distance bound on sliding between crossing-free spanning trees
• Algorithms and Data Structures
• Flipping edges in triangulations
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Reverse search for enumeration
• Sequences of spanning trees and a fixed tree theorem
• Transforming pseudo-triangulations

Cited in

(11)

• Transforming spanning trees: A lower bound
• Bichromatic compatible matchings
• scientific article; zbMATH DE number 2188327 (Why is no real title available?)
• Fast enumeration algorithms for non-crossing geometric graphs
• Transformations of a graph increasing its Laplacian polynomial and number of spanning trees
• Compatible spanning trees in simple drawings of \(K_n\)
• Amortized efficiency of generating planar paths in convex position
• Flips in edge-labelled pseudo-triangulations
• A quadratic distance bound on sliding between crossing-free spanning trees
• Compatible geometric matchings
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees

This page was built for publication: Transforming spanning trees and pseudo-triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044747)