HT-graphs: centers, connected r-domination and Steiner trees
HT-graphs have been introduced in [11] and investigated with respect to location problems on graphs. In this paper two new characterizations of these graphs are given and then it is shown that the central vertex, connected r-domination and Steiner trees problems are linear or almost linear time solv...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
1993-06-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v1-n2/v1-n2-(pp64-83).pdf |