Computing large matchings in planar graphs with fixed minimum degree (Q553342)
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 5932525
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing large matchings in planar graphs with fixed minimum degree |
scientific article; zbMATH DE number 5932525 |
Statements
Computing large matchings in planar graphs with fixed minimum degree (English)
0 references
27 July 2011
0 references
large matching
0 references
mindeg-3 graph
0 references
planar graph
0 references
linear-time
0 references
0.9982123970985411
0 references
0.8875083923339844
0 references
0.8407334685325623
0 references
0.8393468260765076
0 references
0.8263028264045715
0 references
