Minimum Degree Spanning Trees on Bipartite Permutation Graphs
The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path problem. Most of the work done on the minimum degree spanning tree problem has been on approximation algorithms, and very little work has...
Main Author: | Smith, Jacqueline |
---|---|
Other Authors: | Stewart, Lorna (Computing Science) |
Format: | Others |
Language: | en |
Published: |
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/10048/1900 |
Similar Items
-
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
Bipartite embedding of (p,q)-trees
by: Beata Orchel
Published: (2006-01-01) -
On bipartite divisor graph for character degrees
by: Seyed Ali Moosavi
Published: (2017-03-01) -
Spanning tree modulus: deflation and a hierarchical graph structure
by: Clemens, Jason
Published: (2018)