Compatible connectivity augmentation of planar disconnected graphs

DOI10.1007/s00454-015-9716-8zbMath1326.05073arXiv1408.2436OpenAlexW2571115282MaRDI QIDQ894688

Luis Barba, Greg Aloupis, Vida Dujmović, Pat Morin, Fabrizio Frati, Paz Carmi

Publication date: 2 December 2015

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2436

zbMATH Keywords

planar graphsgraph drawingEuclidean minimum spanning trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Optimal morphs of planar orthogonal drawings. II ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Deformations of plane graphs
• Connectivity augmentation in planar straight line graphs
• On the length of optimal TSP circuits in sets of bounded diameter
• Augmenting the connectivity of geometric graphs
• On compatible triangulations of simple polygons
• Über einen geometrischen Satz
• Augmenting the Connectivity of Planar and Geometric Graphs
• The shortest path and the shortest road through n points
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Graph Drawing in Motion
• ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS
• INTRINSIC MORPHING OF COMPATIBLE TRIANGULATIONS
• A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
• Morphing Planar Graph Drawings Optimally
• Morphing Planar Graph Drawings with a Polynomial Number of Steps
• On the Shortest Path Through a Number of Points
• Deformations of Plane Rectilinear Complexes
• Graph Drawing

This page was built for publication: Compatible connectivity augmentation of planar disconnected graphs