Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055)
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 7907329
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs |
scientific article; zbMATH DE number 7907329 |
Statements
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (English)
0 references
5 September 2024
0 references
chordal graphs
0 references
dominating set
0 references
FPT algorithms
0 references
Steiner tree
0 references
undirected path graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8142665028572083
0 references
0.78397536277771
0 references
0.7797689437866211
0 references
0.7730364203453064
0 references
