A Study of the Spanning Star Forest Problem on BipartiteGraphs
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 96 === We study the spanning star forest problem (SSF) and its variation on bipartite graphs (BSSF). The relation between SSF and the dominating set problem (DOM), which has fruitful results in the literature, has been observed. The related optimization problems MSSF a...
Main Authors: | Yen-Yi Lin, 林晏禕 |
---|---|
Other Authors: | Kun-Mao Chao |
Format: | Others |
Language: | en_US |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/72147505010395127099 |
Similar Items
-
The Decompositions of Crowns and Complete Bipartite graphs into star forests
by: Ming-Hong Zhong, et al.
Published: (1996) -
The study of the star arboricity of complete bipartite graphs
by: Yi-Chun Liao, et al.
Published: (2004) -
Star Coloring Outerplanar Bipartite Graphs
by: Ramamurthi Radhika, et al.
Published: (2019-11-01) -
A Bound on the Number of Spanning Trees in Bipartite Graphs
by: Koo, Cheng Wai
Published: (2016) -
Minimum Degree Spanning Trees on Bipartite Permutation Graphs
by: Smith, Jacqueline
Published: (2011)