2023
DOI: 10.1002/rsa.21200
|View full text |Cite
|
Sign up to set email alerts
|

Greedy maximal independent sets via local limits

Michael Krivelevich,
Tamás Mészáros,
Peleg Michaeli
et al.

Abstract: The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the current vertex to the independent set if it is not adjacent to any previously added vertex. In this paper, we present a general framework for computing the asymptotic density of the random greedy independent set for sequences of (possibly random) graphs by employing a notion of local convergence. We use this framework to give straight… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 68 publications
0
0
0
Order By: Relevance