在一致的環狀串列上具自我穩定能力之交換配對; Self-Stabilizing Alternative Matching on uniform rings

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/8874

Title:	在一致的環狀串列上具自我穩定能力之交換配對;Self-Stabilizing Alternative Matching on uniform rings
Authors:	李傳傑;Chuan-Chieh Lee
Contributors:	資訊工程研究所
Keywords:	自我穏定;配對;交換配對;maximum matching;alternative matching;self-stabilizing;matching
Date:	2004-06-21
Issue Date:	2009-09-22 11:36:52 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	本篇論文中，我們設計了一個空間最佳化的演算法來解決雙向鏈結串列中交換配對的問題。每個結點只用了一個指標，在系統穏定之後，在環狀鏈結中會一直存在個配對，系統收斂所需的期望時間為O(n2)。 In this paper, we design a space optimal self-stabilizing algorithm for alternative matching on synchronous bidirectional uniform rings of any size. Each node keeps a pointer. After the system stabilizes, there are always matching pairs on the ring. The expected time for convergence is O(n2)
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing