On making a distinguished vertex of minimum degree by vertex deletion (Q528861)
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: On making a distinguished vertex of minimum degree by vertex deletion |
scientific article; zbMATH DE number 6718311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On making a distinguished vertex of minimum degree by vertex deletion |
scientific article; zbMATH DE number 6718311 |
Statements
On making a distinguished vertex of minimum degree by vertex deletion (English)
0 references
17 May 2017
0 references
graph modification problem
0 references
parameterized complexity
0 references
treewidth
0 references
0 references
0 references
0.9949495196342468
0 references
0.7595937252044678
0 references
0.7568914294242859
0 references
0.7366465926170349
0 references
0.7244111895561218
0 references
