A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs.
Xingfu LiHaodi FengHaitao JiangBinhai ZhuPublished in: FAW (2016)
Keyphrases
- spanning tree
- minimum spanning tree
- undirected graph
- maximum number
- computational complexity
- minimum weight
- worst case
- weighted graph
- learning algorithm
- search space
- optimal solution
- random graphs
- graph isomorphism
- edge weights
- np hard
- minimum spanning trees
- minimum cost
- combinatorial optimization
- tree structure
- probabilistic model
- approximation ratio
- feature space
- hamiltonian cycle
- maximum cardinality
- edge disjoint