Steiner's problem in graphs and its implications

Networks

Volumn 1, Issue 2, 1971, Pages 113-133

  Hakimi, S L ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRIC COMMUNICATION; OPERATIONS RESEARCH;

GRAPH THEORY;

MATHEMATICS;

EID: 0015200656     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230010203     Document Type: Article

References (36)

1. On the Problem of Steiner
2. Steiner Minimal Trees
3. Uber Axiomensysteme fur beliebige Satzsysteme
4. Shortest Path Through a Maze
5. On a Routing Problem
6. Algorith 97, Shortest Path
7. On the Shortest Route Through a Network
8. An Appraisal of Some Shortest Path Algorithm
9. A Graph Theoretic Approach to a Class of Integer‐Programming Problems
10. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
11. Shortest Connection Networks and Some Generalizations
12. Covers and Packings in a Family of Sets
13. Optimum Distribution of Switching Centers in a Communication Network and Some Related Problems
14. Simplification of the Covering Problem with Applications to Boolean Expressions
15. Maximum Internally Stable Sets of a Graph
16. On Finding a Maximum Internally Stable Set of a Graph
17. The Zero‐Error Capacity of a Noisy Channel
18. Combinatorial Communications: Some Results on the Capacity of Graphs
19. Connectivity and Generalized Cliques in Sciometric Group Structure
20. Distance Matrix of a Graph and its Realizability