منابع مشابه
Maximal matching stabilizes in time O(m)
On a network having m edges and n nodes, Hsu and Huang’s self-stabilizing algorithm for maximal matching stabilizes in at most 2m+ n moves. 2001 Elsevier Science B.V. All rights reserved.
متن کاملMaximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width
In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matchingcover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, w...
متن کاملStatistical Matching in ‘Labour Force’ and ‘Time Use’ Surveys
Abstract. In the National Statistical Systems, some parts of the official statistics required for development planning and evidence base management are collected through sampling survey. Due to the high cost of sampling process, as well as nonresponses, it may not be possible to collect all of the expected variables in a survey.In order to obtain a comprehensive and complete source o...
متن کاملA Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time
We present a self-stabilizing algorithm for finding a generalized maximal matching ( -matching) in an arbitrary distributed network. We show that the algorithm converges in moves under an unfair central demon independent of the -values at different nodes. The algorithm is capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1, 2].
متن کاملMaximal Matching for Double Auction
We study the problem of mechanism design for a double auction market where multiple buyers and sellers buy and sell a commodity. We design and implement a matching algorithm that maximizes market liquidity, including the number of transactions and buy/sell-volume. We prove that, given the number of matches, the algorithm also maximizes auctioneer’s profit. Based on the CAT Tournament (Trading A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2001
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00171-5