On the complexity of the maximum biplanar subgraph problem (Q5946290)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1658627
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the maximum biplanar subgraph problem |
scientific article; zbMATH DE number 1658627 |
Statements
On the complexity of the maximum biplanar subgraph problem (English)
0 references
14 October 2001
0 references
bipartite graph
0 references
0 references
0 references
0.879894495010376
0 references
0.8786131143569946
0 references
0.786149799823761
0 references
0.7763589024543762
0 references
0.7743257284164429
0 references
