Computing large matchings fast (Q3188982)
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: Computing large matchings fast |
scientific article; zbMATH DE number 6341859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing large matchings fast |
scientific article; zbMATH DE number 6341859 |
Statements
Computing large matchings fast (English)
0 references
9 September 2014
0 references
3-connected planar graphs
0 references
3-regular graphs
0 references
large matchings
0 references
bounded-degree block trees
0 references
maxdeg-3 graphs
0 references
maximum matchings
0 references
0.8888193368911743
0 references
0.8875083923339844
0 references
0.8724567890167236
0 references
0.8314968347549438
0 references
0.8247250914573669
0 references
