2013
DOI: 10.1016/j.endm.2013.05.134
|View full text |Cite
|
Sign up to set email alerts
|

Exact solution for branch vertices constrained spanning problems

Abstract: Given a connected graph G, a vertex v of G is said to be a branch vertex if its degree is strictly greater than 2. The Minimum Branch Vertices Spanning Tree problem (MBVST) consists in finding a spanning tree of G with the minimum number of branch vertices. This problem has been well studied in the literature and has several applications specially for routing in optical networks. However, this kind of applications do not explicitly impose a sub-graph as solution. A more flexible structure called hierarchy is p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
references
References 4 publications
0
0
0
Order By: Relevance