scientific article
From MaRDI portal
Publication:4037427
zbMath0764.68075MaRDI QIDQ4037427
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmNP-completetriconnectivity augmentationplanar biconnectivity augmentation1--2 matching
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (16)
Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Plane augmentation of plane graphs to meet parity constraints ⋮ On the Hardness and Approximability of Planar Biconnectivity Augmentation ⋮ Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Augmenting the edge connectivity of planar straight line graphs to three ⋮ Connectivity augmentation in planar straight line graphs ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ Completely connected clustered graphs ⋮ An experimental comparison of four graph drawing algorithms. ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Triangulating planar graphs while minimizing the maximum degree ⋮ Approximation algorithms for graph augmentation ⋮ Regular augmentation of planar graphs ⋮ Augmenting the Connectivity of Planar and Geometric Graphs ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
This page was built for publication:
