On the computational difficulty of the terminal connection problem (Q6041044)
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 the computational difficulty of the terminal connection problem |
scientific article; zbMATH DE number 7689050
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational difficulty of the terminal connection problem |
scientific article; zbMATH DE number 7689050 |
Statements
On the computational difficulty of the terminal connection problem (English)
0 references
25 May 2023
0 references
computational difficulty of problems
0 references
parameterized complexity
0 references
terminal vertices
0 references
connection tree
0 references
Steiner tree
0 references
split graphs
0 references
strongly chordal graphs
0 references
cographs
0 references
bounded degree
0 references
0 references
0.9583251476287842
0 references
0.8466542959213257
0 references
0.777558445930481
0 references
0.7602310180664062
0 references
