Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3014681787 / rank | |||
Normal rank | |||
Revision as of 20:47, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time |
scientific article |
Statements
Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (English)
0 references
7 July 2020
0 references
\(S_{1, 1, 5}\)-free graphs
0 references
polynomial time algorithm
0 references
