Network design problems: steiner trees and spanning k -trees

Authors:
Marshall Wayne Bern
Affiliations:
-
Venue:
Network design problems: steiner trees and spanning k -trees
Year:
1987

Citing 0
Cited 3

The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
On the complexity of some subgraph problems

Discrete Applied Mathematics
The complexity of the locally connected spanning tree problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract