Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582)
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 7608297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum matching in almost linear time on graphs of bounded clique-width |
scientific article; zbMATH DE number 7608297 |
Statements
Maximum matching in almost linear time on graphs of bounded clique-width (English)
0 references
27 October 2022
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9940890073776244
0 references
0.8650059700012207
0 references
0.8296666145324707
0 references
0.8005790114402771
0 references
