Simple and Efficient Greedy Algorithms for Hamilton Cycles in Random Intersection Graphs

In this work we consider the problem of finding Hamilton Cycles in graphs derived from the uniform random intersection graphs model Gn, m, p. In particular, (a) for the case m = nα, α> 1 we give a result that allows us to apply (with the same probability of success) any algorithm that finds a Ham...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Raptopoulos, C., Spirakis, P.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Greedy Algorithm Hamilton Cycle Polynomial Time Algorithm Random Geometric Graph Random Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!