A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045)
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: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs |
scientific article; zbMATH DE number 1769295
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs |
scientific article; zbMATH DE number 1769295 |
Statements
21 July 2002
0 references
connected domination
0 references
distance-hereditary graph
0 references
labeling algorithm
0 references
Steiner tree
0 references
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (English)
0 references
0.9008339047431946
0 references
0.9008334875106812
0 references
0.895469605922699
0 references
0.8680022358894348
0 references
0.8531583547592163
0 references
