Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
HT-graphs: centers, connected r-domination and Steiner trees
Authors: F. Dragan
Keywords: HT-graph, vertex elimination ordering, center, connected domination, Steiner tree, linear-time algorithm.
– 0.19 Mb
Keywords: HT-graph, vertex elimination ordering, center, connected domination, Steiner tree, linear-time algorithm.
Abstract
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 solvable in HT-graphs.Feodor Dragan,
Moldavian University,
A.Mateevici str. 60,
Department of Mathematics and Cybernetics,
Chisinau, 277009, Moldova
E-mail:
Moldavian University,
A.Mateevici str. 60,
Department of Mathematics and Cybernetics,
Chisinau, 277009, Moldova
E-mail:
Fulltext
– 0.19 Mb
Contents
- What does the simulation system SOL/PC do?
- The automation of speech parts inflexion process
- The Maple Computer Algebra System
- HT-graphs: centers, connected r-domination and Steiner trees
- Expert games: means to acquire expert knowledge
- An interactive decision support system for selection of scientific and technical projects
- A neural model for the heart muscle
