English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 10525922      Online Users : 105
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 > 電機資訊學院 > 資訊工程學系 > 期刊論文 >  A 2 |E|-bit Distributed Algorithm for the Directed Euler Trail Problem


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


    Title: A 2 |E|-bit Distributed Algorithm for the Directed Euler Trail Problem
    Authors: Chen, Wen-Huei;Tang, Chuan Yi
    教師: 唐傳義
    Date: 1993
    Publisher: Elsevier
    Relation: Information Processing Letters,Volume 47,Issue 1,9 August 1993,Pages 43-49
    Keywords: Algorithms
    Computer science
    Graph theory
    Abstract: A new distributed Euler trial algorithm is proposed to run on an Euler digraph G(V,E) where each node knows only its adjacent edges, converting it into a new state that each node knows how an existent Euler trail routes through its incoming and outgoing edges. The communication requires only 2·|E| one-bit messages. The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected digraph for generating the existent Euler trail or to report that no Euler trails exist.
    URI: http://www.elsevier.com/
    http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66237
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML483View/Open


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

    SFX Query

    與系統管理員聯絡

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