Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102)
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 algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage |
scientific article; zbMATH DE number 7556576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage |
scientific article; zbMATH DE number 7556576 |
Statements
Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (English)
0 references
13 July 2022
0 references
chordal graphs
0 references
undirected path graphs
0 references
dominating set
0 references
Steiner tree
0 references
FPT algorithms
0 references
0 references
0 references
0 references
0 references
0.8928591
0 references
0.8928591
0 references
0.8875093
0 references
0.8836881
0 references
0.88136345
0 references
0.8807461
0 references
0.8807461
0 references
