O(n) Time Algorithms for Dominating Induced Matching Problems (Q5405059): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:56, 9 February 2024
scientific article; zbMATH DE number 6276025
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | O(n) Time Algorithms for Dominating Induced Matching Problems |
scientific article; zbMATH DE number 6276025 |
Statements
O(n) Time Algorithms for Dominating Induced Matching Problems (English)
0 references
31 March 2014
0 references
algorithms
0 references
dominating induced matchings
0 references
graph theory
0 references
