A square time algorithm for cyclic edge connectivity of planar graphs. (Q3134375)
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: A square time algorithm for cyclic edge connectivity of planar graphs. |
scientific article; zbMATH DE number 6837037
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A square time algorithm for cyclic edge connectivity of planar graphs. |
scientific article; zbMATH DE number 6837037 |
Statements
9 February 2018
0 references
square time algorithm
0 references
cyclic edge connectivity
0 references
planar graph
0 references
0.8224111199378967
0 references
0.8112080693244934
0 references
0.79634028673172
0 references
0.7889224290847778
0 references
0.7847878336906433
0 references
