نتایج جستجو برای: maximum average degree
تعداد نتایج: 911195 فیلتر نتایج به سال:
Journal:
:Mathematical Proceedings of the Cambridge Philosophical Society
1986
Journal:
:Journal of Graph Theory
2009
Journal:
:Discrete Mathematics
2020
Journal:
:SIAM Journal on Discrete Mathematics
2016
Journal:
:Mathematical statistics and learning
2022
We study the algorithmic task of finding a large independent set in sparse Erdős– Rényi random graph with $n$ vertices and average degree $d$. The maximum is known to have size $(2 \log d / d)n$ double limit $n \to \infty$ followed by $d \infty$, but best polynomial-time algorithms can only find an half-optimal $(\log d)n$. show that class low-degree polynomial sets no larger, improving upon re...
Journal:
:Information and Computation
1997
Journal:
:The Electronic Journal of Combinatorics
1999
Journal:
:Discrete Mathematics
2003
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید