An algorithm for delta-wye reduction of almost-planar graphs (Q2197481)
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: An algorithm for delta-wye reduction of almost-planar graphs |
scientific article; zbMATH DE number 7242128
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for delta-wye reduction of almost-planar graphs |
scientific article; zbMATH DE number 7242128 |
Statements
An algorithm for delta-wye reduction of almost-planar graphs (English)
0 references
31 August 2020
0 references
delta-wye transformations
0 references
almost-planar graphs
0 references
delta-wye reducibility
0 references
crossing number
0 references
0.9543927907943726
0 references
0.933641791343689
0 references
0.8299935460090637
0 references
0.8230897188186646
0 references
0.8001417517662048
0 references
