The Study of Address Tree Coding Based on the Maximum Matching Algorithm in Courier Business

2010 ◽  
pp. 38-45 ◽  
Author(s):  
Shumin Zhou ◽  
Bin Tang ◽  
Wen Li
Keyword(s):  
Maximum Matching ◽  
Matching Algorithm

Improved Backtracking-Forward Algorithm for Maximum Matching Chinese Word Segmentation

2014 ◽  
Vol 536-537 ◽  
pp. 403-406 ◽  
Author(s):  
Hui Li ◽  
Ping Hua Chen
Keyword(s):  
Maximum Matching ◽  
Counting Method ◽  
Chinese Word Segmentation ◽  
Forward Algorithm ◽  
Matching Algorithm ◽  
Segmentation Analysis ◽  
Segmentation Accuracy ◽  
A Chain ◽  
Language Corpus ◽  
Improved Algorithm

In order to improve the accuracy of segmentation, analysis of backtracking-forward maximum matching algorithm exists two defects when dealing with crossing ambiguity, and on this basis, an improved-backtracking forward algorithm for maximum matching algorithm is presented. The improved algorithm is based on the backtracking-forward maximum matching algorithm and adds a module, a chain length of one and 3-words, that can detect and process crossing ambiguity, and taking advantage of counting method, we can merely sort out the defragmenter fields that occurred crossing ambiguity. A number of selected language corpus tests prove that under the premise of the segmentation speed, the improved algorithm can enhance the segmentation accuracy.

BIPARTITE EXPANDER MATCHING IS IN NC

1995 ◽  
Vol 05 (03) ◽  
pp. 413-420 ◽  
Author(s):  
DAVID J. HAGLIN
Keyword(s):  
Maximum Matching ◽  
Expander Graph ◽  
Expansion Factor ◽  
Matching Algorithm ◽  
Large Expansion ◽  
Deterministic Formula

A work-efficient deterministic [Formula: see text] algorithm is presented for finding a maximum matching in a bipartite expander graph with any expansion factor β > 1. This improves upon a recently presented deterministic [Formula: see text] maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (β ≥ Δ∊, ∊ > 0), and is not work-efficient [1].

scholarly journals Towards Low Delay Sub-Stream Scheduling

2010 ◽  
Vol 5 (5) ◽  
pp. 727 ◽  
Author(s):  
Wu Guofu ◽  
Dou Qiang ◽  
Wu Jiqing ◽  
Ban Dongsong ◽  
Wenhua Dou
Keyword(s):  
Transmission Delay ◽  
Maximum Matching ◽  
Media Content ◽  
Scheduling Problem ◽  
Matching Problem ◽  
Matching Algorithm ◽  
Low Delay ◽  
Weighted Bipartite Graph ◽  
Hybrid Framework ◽  
Minimum Delay

Peer-to-Peer streaming is an effectual and promising way to distribute media content. In a mesh-based system, pull method is the conventional scheduling way. But pull method often suffers from long transmission delay. In this paper, we present a novel sub-stream-oriented low delay scheduling strategy under the push-pull hybrid framework. First the sub-stream scheduling problem is transformed into the matching problem of the weighted bipartite graph. Then we present a minimum delay, maximum matching algorithm. Not only the maximum matching is maintained, but also the transmission delay of each sub-stream is as low as possible. Simulation result shows that our method can greatly reduce the transmission delay.

scholarly journals Problem of Maximum Matching in Non-Bipartite Graph Using Edmonds’ Cardinality Matching Algorithm and Its Applicationin the Battle of Britain Case

CAUCHY ◽  
2019 ◽  
Vol 5 (4) ◽  
pp. 169
Author(s):  
Muchammad Abrori ◽  
Mohammad Imam Jauhari
Keyword(s):  
Graph Theory ◽  
Bipartite Graph ◽  
Maximum Matching ◽  
Greedy Method ◽  
Matching Algorithm ◽  
Shrinking Process

<p>Matching is a part of graph theory that discusses pair. A matching <em>M</em> is called to be maximum if <em>M</em> has the highest number of  elements. A blossom which is encountered in non-bipartite graph can cause failure in process of finding the maximum matching in non-bipartite graph. One of the algorithms that can be used to find a maximum matching in non-bipartite graph is Edmonds’ Cardinality Matching Algorithm. Shrinking process is done in each blossom <em>Bi</em> that is encountered to become pseudovertex <em>bi</em>, in a way that each blossom does not interfere the process of finding a maximum matching in non-bipartite graph. In order to accelerate the finding, simple greedy method is used to perform initialization of matching and BFS algorithm is also used in constructing an alternating tree in a non-bipartite graph.The research discussed the finding of maximum  matching in non-bipartite graph using Edmonds’ cardinality matching algorithm. In addition, this research gave a sample of its application in the resolution of The Battle of Britain case. The result obtained is a maximum matching in non-bipartite graph. The maximum matching obtained is a solution to the case of The Battle of Britain.</p>

Address Analyzer Based on the Maximum Matching Algorithms

2011 ◽  
Vol 460-461 ◽  
pp. 296-299
Author(s):  
Shu Min Zhou ◽  
Rui Chen ◽  
Bin Tang
Keyword(s):  
Matching Theory ◽  
Maximum Matching ◽  
Matching Algorithm ◽  
Unknown Node ◽  
Zip Code

Based on the analysis of current zip code, this article put forward a new encoding algorithm of the address tree - the largest matching algorithm. This algorithm combines the characteristics of the address tree, considering the uniqueness of the address tree, raises a best matching theory, and taking into the matching speed of the address tree, brings in the associate floors of the node of the address tree to improve the efficiency of the match. Because of the change of the address tree, the address tree’s thesaurus in order to timely update its information, increase unknown node by intelligent means automatically.

Sign in / Sign up

Export Citation Format

Share Document