Steiner trees, connected domination and strongly chordal graphs (Q3701460)
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: Steiner trees, connected domination and strongly chordal graphs |
scientific article; zbMATH DE number 3926968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steiner trees, connected domination and strongly chordal graphs |
scientific article; zbMATH DE number 3926968 |
Statements
Steiner trees, connected domination and strongly chordal graphs (English)
0 references
1985
0 references
Steiner tree problems
0 references
connected dominating set problems
0 references
polynomial algorithm
0 references
chordal graphs
0 references
series-parallel graphs
0 references
NP-completeness results
0 references
0.8800754547119141
0 references
0.8489731550216675
0 references
0.8405085802078247
0 references
0.8382161259651184
0 references
0.8376337885856628
0 references
