Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...
We define the Value State Dependence Graph (VSDG). The VSDG is a form of the Value Dependence Graph (VDG) extended by the addition of state dependence edges to model sequentialise...
A number of real-world domains such as social networks and e-commerce involve heterogeneous data that describes relations between multiple classes of entities. Understanding the n...
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...