نتایج جستجو برای: maximum degree
تعداد نتایج: 578216 فیلتر نتایج به سال:
Maximum likelihood estimation in statistics leads to the problem of maximizing a product of powers of polynomials. We study the algebraic degree of the critical equations of this optimization problem. This degree is related to the number of bounded regions in the corresponding arrangement of hypersurfaces, and to the Euler characteristic of the complexified complement. Under suitable hypotheses...
An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of boxicity finds applications in various areas such a...
a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید