Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (Q3066473)
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: Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs |
scientific article; zbMATH DE number 5834520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs |
scientific article; zbMATH DE number 5834520 |
Statements
Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs (English)
0 references
10 January 2011
0 references
edge dominating set
0 references
exact algorithm
0 references
parameterized algorithm
0 references
cubic graph
0 references
0.9579618
0 references
0.9125597
0 references
0.90848213
0 references
0.90848213
0 references
0.9034272
0 references
0 references
0.90052766
0 references
0.90052766
0 references
0 references
0 references
