The strict terminal connection problem on chordal bipartite graphs (Q6496802)
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: The strict terminal connection problem on chordal bipartite graphs |
scientific article; zbMATH DE number 7842440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The strict terminal connection problem on chordal bipartite graphs |
scientific article; zbMATH DE number 7842440 |
Statements
The strict terminal connection problem on chordal bipartite graphs (English)
0 references
6 May 2024
0 references
connection tree
0 references
terminal vertices
0 references
Steiner tree
0 references
chordal bipartite graphs
0 references
\textsf{NP}-completeness
0 references
0.881248414516449
0 references
0.8635488748550415
0 references
0.8597831130027771
0 references
0.8490166068077087
0 references
