A linear algorithm for resource four-partitioning four-connected planar graphs (Q1928628)
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 algorithm for resource four-partitioning four-connected planar graphs |
scientific article; zbMATH DE number 6121765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear algorithm for resource four-partitioning four-connected planar graphs |
scientific article; zbMATH DE number 6121765 |
Statements
A linear algorithm for resource four-partitioning four-connected planar graphs (English)
0 references
3 January 2013
0 references
reource vertex
0 references
vertex partition
0 references
resource 4-partition
0 references
linear algorithm
0 references
0.9117137789726256
0 references
0.7740800976753235
0 references
