Enumeration of articulation pairs of a planar graph (Q1071024): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q583878 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Maciej M. Sysło / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90055-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969522877 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4120604 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Isomorphism of Planar Graphs (Working Paper) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dividing a Graph into Triconnected Components / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Latest revision as of 10:48, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of articulation pairs of a planar graph |
scientific article |
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
