O(n) Time Algorithms for Dominating Induced Matching Problems (Q5405059)
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: O(n) Time Algorithms for Dominating Induced Matching Problems |
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
