An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon Without Global Identifiers

Lecture Notes in Computer Science - Stabilization, Safety, and Security of Distributed Systems ◽

10.1007/978-3-319-49259-9_17 ◽

2016 ◽

pp. 195-212 ◽

Author(s):

Michiko Inoue ◽

Fukuhito Ooshita ◽

Sébastien Tixeuil

Keyword(s):

Matching Algorithm ◽

Maximal Matching

Download Full-text

A new self-stabilizing maximal matching algorithm

Theoretical Computer Science ◽

10.1016/j.tcs.2008.12.022 ◽

2009 ◽

Vol 410 (14) ◽

pp. 1336-1345 ◽

Author(s):

Fredrik Manne ◽

Morten Mjelde ◽

Laurence Pilard ◽

Sébastien Tixeuil

Keyword(s):

Matching Algorithm ◽

Maximal Matching

Download Full-text

An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

Journal of Graph Algorithms and Applications ◽

10.7155/jgaa.00384 ◽

2016 ◽

Vol 20 (1) ◽

pp. 59-78 ◽

Author(s):

Yuma Asada ◽

Fukuhito Ooshita ◽

Michiko Inoue

Keyword(s):

Matching Algorithm ◽

Maximal Matching ◽

Anonymous Networks

Download Full-text

o(log4 n) time parallel maximal matching algorithm using linear number of processors

Parallel Algorithms and Applications ◽

10.1080/1063719042000208827 ◽

2004 ◽

Vol 19 (1) ◽

pp. 19-32 ◽

Author(s):

Alak Kumar Datta ◽

Ranjan Kumar Sen†

Keyword(s):

Matching Algorithm ◽

Maximal Matching

Download Full-text

An Efficient Silent Self-stabilizing 1-Maximal Matching Algorithm Under Distributed Daemon for Arbitrary Networks

Lecture Notes in Computer Science - Stabilization, Safety, and Security of Distributed Systems ◽

10.1007/978-3-319-69084-1_7 ◽

2017 ◽

pp. 93-108 ◽

Author(s):

Michiko Inoue ◽

Fukuhito Ooshita ◽

Sébastien Tixeuil

Keyword(s):

Matching Algorithm ◽

Maximal Matching

Download Full-text

A New Self-stabilizing Maximal Matching Algorithm

Structural Information and Communication Complexity - Lecture Notes in Computer Science ◽

10.1007/978-3-540-72951-8_9 ◽

2007 ◽

pp. 96-108 ◽

Author(s):

Fredrik Manne ◽

Morten Mjelde ◽

Laurence Pilard ◽

Sébastien Tixeuil

Keyword(s):

Matching Algorithm ◽

Maximal Matching

Download Full-text

HMM-BiMM: Hidden Markov Model-based word segmentation via improved Bi-directional Maximal Matching algorithm

Computers & Electrical Engineering ◽

10.1016/j.compeleceng.2021.107354 ◽

2021 ◽

Vol 94 ◽

pp. 107354

Author(s):

Xingyu Yan ◽

Xiaofan Xiong ◽

Xiufeng Cheng ◽

Yujing Huang ◽

Haitao Zhu ◽

...

Keyword(s):

Markov Model ◽

Hidden Markov Model ◽

Hidden Markov ◽

Word Segmentation ◽

Matching Algorithm ◽

Maximal Matching ◽

Download Full-text

Administrative Divisions of Addresses Matching Algorithm Based on Moving Window Algorithm for Maximal Matching

Lecture Notes in Electrical Engineering - Information Science and Applications (ICISA) 2016 ◽

10.1007/978-981-10-0557-2_82 ◽

2016 ◽

pp. 861-872

Author(s):

Xiaolin Li ◽

Shuang Huang ◽

Tao Lu

Keyword(s):

Moving Window ◽

Matching Algorithm ◽

Maximal Matching

Download Full-text

A Parallel Maximal Matching Algorithm for Large Graphs Using Pregel

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e97.d.1910 ◽

2014 ◽

Vol E97.D (7) ◽

pp. 1910-1913 ◽

Author(s):

Byungnam LIM ◽

Yon Dohn CHUNG

Keyword(s):

Large Graphs ◽

Matching Algorithm ◽

Maximal Matching

Download Full-text

The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm

IEICE Transactions on Information and Systems ◽

10.1587/transinf.e93.d.2850 ◽

2010 ◽

Vol E93-D (10) ◽

pp. 2850-2853 ◽

Author(s):

Masahiro KIMOTO ◽

Tatsuhiro TSUCHIYA ◽

Tohru KIKUNO

Keyword(s):

Time Complexity ◽

Matching Algorithm ◽

Maximal Matching

Download Full-text

AN IMPROVED MAXIMAL MATCHING ALGORITHM

Parallel Processing Letters ◽

10.1142/s0129626491000082 ◽

1991 ◽

Vol 01 (02) ◽

pp. 135-142

Author(s):

S. B. YANG ◽

S. K. DHALL ◽

S. LAKSHMIVARAHAN

Keyword(s):

Undirected Graph ◽

Matching Algorithm ◽

Maximal Matching ◽

Expected Time ◽

In this paper we present a randomized parallel maximal matching algorithm that requires only O(n) processors on an. EREW PRAM, where n is the number of vertices in an undirected graph G = (V, E). Our algorithm outputs a matching in O( log 2 m) expected time, where m is the number of edges in G. The probability that the output of our algorithm is maximal is at least 1 − e−k, where k is a constant.

Download Full-text