A simple test on 2-vertex- and 2-edge-connectivity (Q1943645)
From MaRDI portal
 | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See A simple test on 2-vertex- and 2-edge-connectivity for the user view. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple test on 2-vertex- and 2-edge-connectivity |
scientific article |
Statements
A simple test on 2-vertex- and 2-edge-connectivity (English)
0 references
20 March 2013
0 references
graph algorithms
0 references
2-vertex-connectivity
0 references
2-edge-connectivity
0 references
linear time algorithms
0 references
bridges
0 references
cut vertices
0 references
