跳到主要內容

簡易檢索 / 詳目顯示

研究生: 蕭翊嘉
Yi-Jia Hsiao
論文名稱: 超立方體圖與格子圖上的目標集問題
Target Set Selection Problem on Hypercubes and Grids
指導教授: 葉鴻國
Hong-Gwa Yeh
口試委員:
學位類別: 碩士
Master
系所名稱: 理學院 - 數學系
Department of Mathematics
論文出版年: 2015
畢業學年度: 103
語文別: 中文
論文頁數: 29
中文關鍵詞: 超立方體圖格子圖目標集問題
相關次數: 點閱:16下載:0
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  • 本篇論文,主要探討特殊圖形的Target Set Selection Problem (TSS Problem)。


    This paper focuses on Target Set Selection Problem(TSS Problem) of special graph.

    1 Introduction and preliminaries...P1 2 TSSA Problem on Hypercubes.......P5 3 TSSB Problem on the grid P2Pn....P13

    [1] O. Ben-Zwi, D. Hermelin, D. Lokshtanov and I. Newman, Treewidth governs the complexity of target set selection, Discrete Optimization (2010), doi: 10. 1016/j. disopt. 2010. 09. 007.
    [2] Béla Bollobás, The Art Of Mathematics Coffee Time in Memphis, Cambridge University Pressm (2006).
    [3] N. Chen, On the approximability of influence in social networks, SIAM Journal on Discrete Mathematics, 23 (2009) 1400-1415.
    [4] C-Y Chiang, L-H Huang and H-G Yeh, Target set selection problem for honeycomb networks, SIAM J. Discrete Math. 23 (2013) 310-328.

    QR CODE
    :::