The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073)
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 7327712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes |
scientific article; zbMATH DE number 7327712 |
Statements
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (English)
0 references
25 March 2021
0 references
maximum matching
0 references
FPT in P
0 references
modular decomposition
0 references
pruned graphs
0 references
one-vertex extensions
0 references
\( P_4\)-structure
0 references
0 references
0 references
0.9943845
0 references
0.87064874
0 references
0 references
0 references
0.8623938
0 references
0.8549454
0 references
0.8537856
0 references
0 references
