Publication:4230328
From MaRDI portal
zbMath0918.68074MaRDI QIDQ4230328
Publication date: 22 April 1999
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C40: Connectivity
Related Items
Augmenting trees so that every three vertices lie on a cycle, Augmenting the rigidity of a graph in \(\mathbb R^{2}\), Guthrie's problem: new equivalences and rapid reductions, An approximation algorithm for minimum-cost vertex-connectivity problems, Augmenting the connectivity of outerplanar graphs, Augmenting the connectivity of geometric graphs, Triangulating planar graphs while minimizing the maximum degree, Multigraph augmentation under biconnectivity and general edge-connectivity requirements