An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(m n) algorithm for the weighted stable set problem in claw-free graphs with (G) 3 |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.907930076122284
0 references
0.893099844455719
0 references
0.8923896551132202
0 references
0.8891446590423584
0 references
