On the smallest sets blocking simple perfect matchings in a convex geometric graph (Q1758986)
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: On the smallest sets blocking simple perfect matchings in a convex geometric graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the smallest sets blocking simple perfect matchings in a convex geometric graph |
scientific article |
Statements
On the smallest sets blocking simple perfect matchings in a convex geometric graph (English)
0 references
19 November 2012
0 references
geometric graphs
0 references
simple perfect matching
0 references
blocking edge set
0 references
0.875787079334259
0 references
0.8102849125862122
0 references
0.7655969262123108
0 references
0.7587206363677979
0 references
0.7485169768333435
0 references
