Computing large matchings in planar graphs with fixed minimum degree (Q3652274)
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 5649439
| 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 5649439 |
Statements
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree (English)
0 references
17 December 2009
0 references
algorithms
0 references
computing large matchings
0 references
fixed minimum degree
0 references
computing maximum matchings
0 references
0.9982123970985411
0 references
0.8888193368911743
0 references
0.8427037596702576
0 references
0.8423914909362793
0 references
