A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION

DOI10.1142/S0129054113400054zbMath1273.90175OpenAlexW2151153553MaRDI QIDQ2841986

N. Sadagopan, N. S. Narayanaswamy

Publication date: 30 July 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400054

zbMATH Keywords

biconnectivity augmentationchordal augmentationtriconnectivity augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Tri-connectivity augmentation in trees

Cites Work

• The clique-separator graph for chordal graphs
• Edge-connectivity augmentation problems
• Clique tree generalization and new subclasses of chordal graphs
• Augmentation Problems
• Smallest Augmentations to Biconnect a Graph
• On Four-Connecting a Triconnected Graph
• Simpler and faster biconnectivity augmentation
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: A UNIFIED FRAMEWORK FOR BI(TRI)CONNECTIVITY AND CHORDAL AUGMENTATION