Results 1  10
of
3,361
Small Maximal Matchings in Random Graphs
 IN PROC. LATIN 2000, PP 1827. LNCS 1776
, 2000
"... We look at the minimal size of a maximal matching in general, bipartite and dregular random graphs. We prove that with high probability the ratio between the sizes of any two maximal matchings approaches one in dense random graphs and random bipartite graphs. Weaker bounds hold for sparse random g ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We look at the minimal size of a maximal matching in general, bipartite and dregular random graphs. We prove that with high probability the ratio between the sizes of any two maximal matchings approaches one in dense random graphs and random bipartite graphs. Weaker bounds hold for sparse random
Distributed maximal matching: greedy is optimal
 Manuscript
, 2011
"... We study distributed algorithms that find a maximal matching in an anonymous, edgecoloured graph. If the edges are properly coloured with k colours, there is a trivial greedy algorithm that finds a maximal matching in k − 1 synchronous communication rounds. The present work shows that the greedy ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We study distributed algorithms that find a maximal matching in an anonymous, edgecoloured graph. If the edges are properly coloured with k colours, there is a trivial greedy algorithm that finds a maximal matching in k − 1 synchronous communication rounds. The present work shows that the greedy
Maximal Matching Scheduling is Good Enough
"... In highspeed switches the Input Queued(IQ) architecture is very popular due to its low memorybandwidth requirement compared to the Output Queued (OQ) switch architecture which is extremely desirable in terms of performance but requires very high memorybandwidth. In the past decade researchers and ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
delay performance of algorithms. This paper mainly studies the delay properties of a class of scheduling algorithms known as maximal matching algorithms. It has been known that Maximum weight matching(MWM) scheduling algorithm provides the maximum possible throughput, also denoted as 100% throughput [1
The maximal matching energy of tricyclic graphs
 Adjacent Eccentric Distance Sum Index PLOS ONE  DOI:10.1371/journal.pone.0129497 June 19, 2015 10 / 12
"... Abstract Gutman and Wagner proposed the concept of the matching energy (M E) and pointed out that the chemical applications of M E go back to the 1970s. Let G be a simple graph of order n and µ 1 , µ 2 , . . . , µ n be the roots of its matching polynomial. The matching energy of G is defined to be ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
to be the sum of the absolute values of µ i (i = 1, 2, . . . , n). Gutman and Cvetković determined the tricyclic graphs on n vertices with maximal number of matchings by a computer search for small values of n and by an induction argument for the rest. Based on this result, in this paper, we characterize
Maximizing matching in doublesided auctions.
, 2011
"... ABSTRACT Traditionally in double auctions, offers are cleared at the equilibrium price. In this paper, we introduce a novel, nonrecursive, matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. Our algorithm has lower time and space complexities than ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ABSTRACT Traditionally in double auctions, offers are cleared at the equilibrium price. In this paper, we introduce a novel, nonrecursive, matching algorithm for double auctions, which aims to maximize the amount of commodities to be traded. Our algorithm has lower time and space complexities
Maximal matching stabilizes in time O(m)
, 2001
"... On a network having m edges and n nodes, Hsu and Huang's selfstabilizing algorithm for maximal matching stabilizes in at most 2m n moves. 2001 Elsevier Science B.V. All rights reserved. ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
On a network having m edges and n nodes, Hsu and Huang's selfstabilizing algorithm for maximal matching stabilizes in at most 2m n moves. 2001 Elsevier Science B.V. All rights reserved.
Distributed Weighted Vertex Cover via Maximal Matchings
, 2004
"... In this paper we consider the problem of computing a minimumweight vertexcover in an nnode, weighted, undirected graph G = (V,E). We present a fully distributed algorithm for computing vertex covers of weight at most twice the optimum, in the case of integer weights. Our algorithm runs in an expe ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
in an expected number of O(logn + log ˆW) communication rounds, where ˆW is the average vertexweight. The previous best algorithm for this problem requires O(logn(log n + log ˆW)) rounds and it is not fully distributed. For a maximal matching M in G it is a wellknown fact that any vertexcover in G needs
A tight analysis of the maximal matching heuristic
 IN PROC. OF THE ELEVENTH INTERNATIONAL COMPUTING AND COMBINATORICS CONFERENCE (COCOON), LNCS
, 2005
"... We study the algorithm that iteratively removes adjacent vertices from a simple, undirected graph until no edge remains. This algorithm is a wellknown 2approximation to three classical NPhard optimization problems: MINIMUM VERTEX COVER, MINIMUM MAXIMAL MATCHING and MINIMUM EDGE DOMINATING SET. W ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study the algorithm that iteratively removes adjacent vertices from a simple, undirected graph until no edge remains. This algorithm is a wellknown 2approximation to three classical NPhard optimization problems: MINIMUM VERTEX COVER, MINIMUM MAXIMAL MATCHING and MINIMUM EDGE DOMINATING SET
Results 1  10
of
3,361