Efficient enumeration of graph orientations with sources

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

We introduce a family of DG methods for (1.1)–(1.3) based on the coupling of a DG approximation to the Vlasov equation (transport equation) with several mixed finite element methods

First introduced by Faddeev and Kashaev [7, 9], the quantum dilogarithm G b (x) and its variants S b (x) and g b (x) play a crucial role in the study of positive representations

it is possible to find two planar graphs which can be combined into a graph G, which then in turn can be decomposed into n edge-disjoint nonplanar graphs.. On the

For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex coloring and fre- quency assignment problems.. In

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

The problem is to construct and implement a scheduling algorithm to send as much as possible trains for period of time T in both directions (more specifically we are interested in

Stability of representation with respect to increasing lim- its of Newtonian and Riesz potentials is established in ([16], Theorem 1.26, Theorem 3.9).. Convergence properties