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
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1501.05773 / rank | |||
Normal rank | |||
Revision as of 05:00, 19 April 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
