Steiner distance stable graphs (Q1336650): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Ortrud R. Oellermann / rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferdinand Gliviak / rank | |||
Property / author | |||
Property / author: Ortrud R. Oellermann / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ferdinand Gliviak / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geodetic connectivity of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3980565 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steiner problem in networks: A survey / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)90232-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2063390742 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Steiner distance stable graphs |
scientific article |
Statements
Steiner distance stable graphs (English)
0 references
20 March 1995
0 references
The authors give a short overview of useful notions and results dealing with Steiner distance stable graphs. They generalize these notions and define \(k\)-vertex \(l\)-edge \((s,m)\)-Steiner distance stable graphs, where \(k\), \(l\), \(s\) and \(m\) are nonnegative integers with \(m\geq s\geq 2\) and \(k\) and \(l\) are not both zero. The authors study relatively hard mathematical problems and also discuss the computational complexity of some of them.
0 references
Steiner distance stable grahs
0 references
computational complexity
0 references