Maximum induced matchings of random cubic graphs

We present a heuristic for finding a large induced matching of cubic graphs. We analyse the performance of this heuristic, which is a random greedy algorithm, on random cubic graphs using differential equations and obtain a lower bound on the expected size of the induced matching, M , returned by th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computational and applied mathematics 2002-05, Vol.142 (1), p.39-50
Hauptverfasser:	Duckworth, W., Wormald, N.C., Zito, M.
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!