Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum matching in almost linear time on graphs of bounded clique-width |
scientific article |
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
