O(n) Time Algorithms for Dominating Induced Matching Problems (Q5405059): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_35 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2260246106 / rank | |||
Normal rank | |||
Latest revision as of 18:42, 19 March 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
