A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104)
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 linear-time algorithm for four-partitioning four-connected planar graphs |
scientific article; zbMATH DE number 6585430
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time algorithm for four-partitioning four-connected planar graphs |
scientific article; zbMATH DE number 6585430 |
Statements
A linear-time algorithm for four-partitioning four-connected planar graphs (English)
0 references
26 May 2016
0 references
graph partition
0 references
four-connected planar graph
0 references
linear-time algorithms
0 references
canonical decomposition
0 references
\(st\)-numbering
0 references
0.9689834
0 references
0.89789444
0 references
0.89501345
0 references
0.88925993
0 references
0.88001907
0 references
