A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (Q4540045): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199805)31:3<177::aid-net4>3.0.co;2-c / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2059518216 / rank | |||
Normal rank | |||
| Property / title | |||
A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (English) | |||
| Property / title: A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs (English) / rank | |||
Normal rank | |||
Latest revision as of 10:33, 30 July 2024
scientific article; zbMATH DE number 1769295
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
