Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582): Difference between revisions
From MaRDI portal
Changed label, description and/or aliases in en, and other parts |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:39, 24 November 2025
scientific article; zbMATH DE number 7608297
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
