English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14556061      Online Users : 80
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 optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs

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

    Title: An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
    Authors: Wang,Biing-Feng;Ku,S.-C.
    教師: 王炳豐
    Date: 2002
    Publisher: Elsevier
    Relation: JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING,Volume 62,Issue 2,Pages 221-227,FEB 2002
    Keywords: maximal outerplanar graphs
    parallel algorithms
    Abstract: An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outer-planarity. In this paper, an optimal parallel algorithm is proposed on the EREW PRAM for testing isomorphism of two maximal outerplanar graphs. The proposed algorithm takes O(log n) time using O(n) work. Besides being optimal, it is very simple. Moreover, it can be implemented optimally on the CRCW PRAM in O(1) time.
    URI: http://www.elsevier.com/
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat


    SFX Query


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