Parameterized Complexity of Independence and Domination on Geometric Graphs (Q3499733)
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: Parameterized Complexity of Independence and Domination on Geometric Graphs |
scientific article; zbMATH DE number 5282013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of Independence and Domination on Geometric Graphs |
scientific article; zbMATH DE number 5282013 |
Statements
Parameterized Complexity of Independence and Domination on Geometric Graphs (English)
0 references
3 June 2008
0 references
0.90911406
0 references
0.90911406
0 references
0.9078122
0 references
0.90749514
0 references
0.90523505
0 references
0.9006793
0 references
0.89495826
0 references
0.8941971
0 references
