Maintenance of triconnected components of graphs
type: Item
instance of: scholarly article
title: Maintenance of triconnected components of graphs
zbMATH Open document ID: 1427.68247
DOI: 10.1007/3-540-55719-9_87
published in: Automata, Languages and Programming
publication date: 2019-12-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7139644
author: Johannes A. La Poutré
MaRDI profile type: MaRDI publication profile
full work available at URL: 3-540-55719-9 87
OpenAlex ID: W1552226600
cites work: Q3138872
cites work: Q4038721
cites work: Q3138871
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Q3138921
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Fully Dynamic Algorithms for 2-Edge Connectivity
cites work: Q5572939
cites work: Dividing a Graph into Triconnected Components
cites work: Amortized efficiency of a path retrieval data structure
cites work: Finding paths and deleting edges in directed acyclic graphs
cites work: Q3813313
cites work: Q3138878
cites work: Maintenance of 2- and 3-edge-connected components of graphs. I
cites work: Maintenance of 2- and 3-Edge-Connected Components of Graphs II
cites work: Alpha-algorithms for incremental planarity testing (extended abstract)
cites work: Q3685214
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Q5524326
cites work: Maintaining bridge-connected and biconnected components on-line
cites work: Fast incremental planarity testing
Recommended article: Maintenance of 2- and 3-edge-connected components of graphs. I
Recommended article: Maintenance of 2- and 3-Edge-Connected Components of Graphs II
Recommended article: Maintaining the 3-Edge-Connected Components of a Graph On-Line
Recommended article: The structure of a decomposition of a triconnected graph
Recommended article: Q4036576
Recommended article: The connectivity carcass of a vertex subset in a graph and its incremental maintenance
Recommended article: The General Structure of Edge-Connectivity of a Vertex Subset in a Graph and its Incremental Maintenance. Odd Case
Recommended article: Q3813313
Recommended article: Dynamic maintenance of planar digraphs, with applications
Recommended article: Triangulating remnants of complete graphs
description: scientific article; zbMATH DE number 7139644