Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (Q4844576)
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: Branch-and-bound techniques for the maximum planar subgraph problem∗ |
scientific article; zbMATH DE number 790914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> |
scientific article; zbMATH DE number 790914 |
Statements
Branch-and-bound techniques for the maximum planar subgraph problem<sup>∗</sup> (English)
0 references
10 October 1995
0 references
branch-and-bound algorithms
0 references
0 references
0 references
0.8490442633628845
0 references
0.8429844975471497
0 references
0.8342089653015137
0 references
0.8338750004768372
0 references
