Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time (Q777392): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2020.03.043 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2020.03.043 / rank | |||
Normal rank | |||
Revision as of 09:22, 9 December 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
0 references
