نتایج جستجو برای: β cuts
تعداد نتایج: 190224 فیلتر نتایج به سال:
2013
Roland Glantz
Henning Meyerhenke
In this paper we address the task of finding convex cuts of a graph. In addition to the theoretical value of drawing a connection between geometric and combinatorial objects, cuts with this or related properties can be beneficial in various applications, e. g., routing in road networks and mesh partitioning. It is known that the decision problem whether a general graph is k-convex is NP-complet...
Journal:
:Combinatorics, Probability and Computing
2006
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید