Enumeration of articulation pairs of a planar graph (Q1071024)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of articulation pairs of a planar graph |
scientific article; zbMATH DE number 3937191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumeration of articulation pairs of a planar graph |
scientific article; zbMATH DE number 3937191 |
Statements
Enumeration of articulation pairs of a planar graph (English)
0 references
1985
0 references
This paper presents a simple algorithm for the enumeration of pairs of articulation vertices in a planar graph. It is based on a rather trivial characterization of articulation pairs which makes use of a planar representation of a graph. The algorithm has time complexity \(O(n^ 2)\), where n is the number of vertices of a graph.
0 references
connectivity
0 references
algorithm
0 references
enumeration
0 references
pairs of articulation vertices
0 references
planar graph
0 references
0.7527362704277039
0 references
0.7436445951461792
0 references
0.7432042360305786
0 references
0.7420903444290161
0 references
0.7342978715896606
0 references
