English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13391567      Online Users : 359
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  An O(n^2 \log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/12586

    Title: An O(n^2 \log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
    Authors: Wei-Kuan Shih
    Wen-Lian Hsu
    T. C. Chern
    教師: 石維寬
    Date: 1992
    Publisher: Society for Industrial and Applied Mathematics
    Relation: Discrete Applied Mathematics
    Volume 25, Issue 3, November 1989, Pages 321-323 "
    Keywords: graph
    Hamiltonian cycle
    Abstract: A circular arc family $F$ is a collection of arcs on a circle. A circular-arc graph is the intersection graph of an arc family. A Hamiltonian cycle (HC) in a graph is a cycle that passes through every vertex exactly once. This paper presents an $O(n^2 \log n)$ algorithm to determine whether a given circular-arc graph contains an HC. This algorithm is based on two subroutines for interval graphs: (i) a linear time greedy algorithm for the node disjoint path cover problem and (ii) a linear time HC algorithm. If the given graph does not contain an HC, this paper can produce a proof either through the deletion of an appropriate cutset or through the failure to obtain a specific type of HC.
    Relation Link: http://epubs.siam.org/
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/12586
    Appears in Collections:[資訊工程學系] 期刊論文
    [資訊系統與應用研究所] 期刊論文
    [電腦與通訊科技研發中心] 期刊論文

    Files in This Item:

    File Description SizeFormat
    2030218010029.pdf2050KbAdobe PDF875View/Open


    SFX Query


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