\(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 the normal view instead:
scientific article; zbMATH DE number 6276025
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9654268026351928
0 references
0.8762993812561035
0 references
0.8510391712188721
0 references
0.8415911793708801
0 references
0.8266876935958862
0 references
