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
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3416248 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding and counting small induced subgraphs efficiently / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) / rank | |||
Normal rank | |||
Revision as of 03:40, 14 July 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
