Making an arbitrary filled graph minimal by removing fill edges (Q4375644)
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: Making an arbitrary filled graph minimal by removing fill edges |
scientific article; zbMATH DE number 1113869
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making an arbitrary filled graph minimal by removing fill edges |
scientific article; zbMATH DE number 1113869 |
Statements
Making an arbitrary filled graph minimal by removing fill edges (English)
0 references
8 February 1998
0 references
fill edges
0 references
filled graph
0 references
algorithm
0 references
0.9102154
0 references
0 references
0.8621566
0 references
0.8610878
0 references
0.8602761
0 references
0 references
