Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2014) | last year (2013) | two years ago (2012) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao

dblp
dblp
dblp
dblp

Not MPG Author(s):

Tamaki, Hisao

Editor(s):

Diekert, Volker
Habib, Michel

dblp
dblp

Not MPII Editor(s):

Diekert, Volker
Habib, Michel

BibTeX cite key*:

bast04stacs

Title, Booktitle

Title*:

Matching Algorithms Are Fast in Sparse Random Graphs

Booktitle*:

21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)

Event, URLs

URL of the conference:

http://www.lirmm.fr/stacs2004/

URL for downloading the paper:

http://www.mpi-sb.mpg.de/~schaefer/ftp/pdf/avg-matching.pdf

Event Address*:

Montpellier, France

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

25 March 2004

Event End Date:

27 March 2004

Publisher

Name*:

Springer

URL:


Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

2996

Number:


Month:


Pages:

81-92

Year*:

2004

VG Wort Pages:

25

ISBN/ISSN:

3-540-21236-1

Sequence Number:


DOI:

10.1007/b96012



Note, Abstract, ©


(LaTeX) Abstract:

We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability every nonmaximum matching has an augmenting path of length O(log n). This implies that augmenting path algorithms like the Hopcroft Karp algorithm for bipartite graphs and the Micali Vazirani algorithm for general graphs, which have a worst case running time of O(mpn), run in time O(mlog n) with high probability, where m is the number of edges in the graph. Motwani proved these results for random graphs when the average degree is at least ln(n) [Average Case Analysis of Algorithms for Matchings and Related Problems, Journal of the ACM, 41(6), 1994]. Our results hold, if only the average degree is a large enough constant. At the same time we simplify the analysis of Motwani.

URL for the Abstract:

http://springerlink.metapress.com/content/06w1a8rdv18257nm/?p=4bc1f3e39909440ba6af9d3c10ab269c&pi=7



Download
Access Level:

Intranet

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{bast04stacs,
AUTHOR = {Bast, Holger and Mehlhorn, Kurt and Sch{\"a}fer, Guido and Tamaki, Hisao},
EDITOR = {Diekert, Volker and Habib, Michel},
TITLE = {Matching Algorithms Are Fast in Sparse Random Graphs},
BOOKTITLE = {21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04)},
PUBLISHER = {Springer},
YEAR = {2004},
VOLUME = {2996},
PAGES = {81--92},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Montpellier, France},
ISBN = {3-540-21236-1},
DOI = {10.1007/b96012},
}


Entry last modified by Anja Becker, 01/08/2008
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)