National Tsing Hua University Institutional Repository:Generating All Maximal Independent Sets on Trees in Lexicographic Order
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 15079386      在线人数 : 130
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  Generating All Maximal Independent Sets on Trees in Lexicographic Order


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80792


    题名: Generating All Maximal Independent Sets on Trees in Lexicographic Order
    作者: Chang, Y. H.;Wang, J. S.;Lee, R. C. T.
    教師: 李家同
    日期: 1994
    出版者: Elsevier
    關聯: INFORMATION SCIENCES, Elsevier, Volume 76, 1994, Pages 279-296
    关键词: Lexicographic Order
    摘要: An algorithm to generate all maximal independent sets in lexicographic order with polynomial time delay between the output of two successive independent sets was proposed by Johnson. This algorithm needs an exponential amount of space. Johnson suggested an open problem, which is to find such an algorithm with polynomial time delay and space needed between the output of two successive maximal independent sets. In this paper, we try to investigate this problem on trees. We first introduce a new problem—the constrained maximal independent set problem, which is NP-complete for general graphs. We show that, for trees, the constrained maximal independent set problem can be solved in θ(n) time, where n is the number of vertices. Based upon this algorithm, we propose another algorithm that generates all maximal independent sets in lexicographic order with O(n2) delay between the output of any two successive independent sets with O(n) space for trees. In other words, we partially solve Johnson's open problem.
    相関连結: http://www.elsevier.com/wps/find/homepage.cws_home
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80792
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML975检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈