Cyclewidth and the grid theorem for perfect matching width of bipartite graphs (Q2301534)
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 7173290
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cyclewidth and the grid theorem for perfect matching width of bipartite graphs |
scientific article; zbMATH DE number 7173290 |
Statements
Cyclewidth and the grid theorem for perfect matching width of bipartite graphs (English)
0 references
24 February 2020
0 references
branch decomposition
0 references
perfect matching
0 references
directed treewidth
0 references
matching minor
0 references
0.8288276791572571
0 references
0.8027572631835938
0 references
0.7943410873413086
0 references
0.7558231949806213
0 references
