An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:43, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) |
scientific article |
Statements
An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (English)
0 references
21 July 2017
0 references
claw-free graphs
0 references
stable set
0 references
algorithms
0 references
