A note on the computational complexity of graph vertex partition 夡

An adjacent vertex-distinguishing k-edge coloring, or k-avd-coloring for short, of a graph G is a proper edge coloring of G using at most k colors such that, for every pair of

Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is

To avoid the effect of high degree vertices in graph processing, we introduce, in this section, a new approach, called GPHD (Graph Partitioning for High Degree vertices) to

Delano¨e [4] proved that the second boundary value problem for the Monge-Amp`ere equation has a unique smooth solution, provided that both domains are uniformly convex.. This result

In this paper, we construct a graph G having no two cycles with the same length which leads to the following

As Borsuk-Ulam theorem implies the Brouwer fixed point theorem we can say that the existence of a simple and envy-free fair division relies on the Borsuk-Ulam theorem.. This

We first introduce the notion of λ-K¨ onig relational graph model (Definition 6.5), and show that a relational graph model D is extensional and λ-K¨ onig exactly when the

The problem of deciding the existence of a SEPI from G to G’ is NP-complete, but show that when G is fixed, this problem can be decided in constant-time (hint: this