The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes |
scientific article |
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
