勤益科大機構典藏:Item 987654321/3364
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 2928/5721 (51%)
造访人次 : 375879      在线人数 : 593
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


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


    题名: The rook problem on saw-toothed chessboards
    作者: Hon-Chan Chen;Ting-Yem Ho
    贡献者: 勤益科技大學
    日期: 2008-12
    上传时间: 2010-03-22 18:12:36 (UTC+8)
    摘要: A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i,j) can dominate the squares in row i and in column j. The rook problem of an STC is to determine the minimum number of rooks that can dominate all squares of the STC. In this paper, we model an STC by two particular graphs: a rook graph and a board graph. We show that for an STC, the rook graph is the line graph of the board graph, and the board graph is a bipartite permutation graph. Thus, the rook problem on STCs can be solved by any algorithm for solving the edge domination problem on bipartite permutation graphs.
    關聯: Applied Mathematics Letters
    显示于类别:[資訊管理系(研發與科技管理研究所)] 【資訊管理系】期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    The rook problem on saw-toothed chessboards.pdf290KbAdobe PDF2446检视/开启


    在NCUTIR中所有的数据项都受到原著作权保护.

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