Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

LATIN
2000
Springer

103views Information Technology» more LATIN 2000»

Small Maximal Matchings in Random Graphs

15 years 6 months ago

Small Maximal Matchings in Random Graphs

Download www.ulb.ac.be

We look at the minimal size of a maximal matching in general, bipartite and

Michele Zito

Real-time Traffic

-regular Random Graphs | Information Management | LATIN 2000 | Maximal Matchings | Random Graphs |

claim paper

Related Content

» Maintaining a large matching and a small vertex cover

» Matching Free Trees Maximal Cliques and Monotone Game Dynamics

» Matching Free Trees with Replicator Equations

» Inexpensive ddimensional matchings

» When LP is the Cure for Your Matching Woes Improved Bounds for Stochastic Matchings

» Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs

» A Functional Approach to External Graph Algorithms

» Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

» On Revenue Maximization in SecondPrice Ad Auctions

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	2000
Where	LATIN
Authors	Michele Zito

Comments (0)