As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Abstract. Extensible Dependency Grammar (XDG) is a graph description language whose formulas can be solved by constraint programming. XDG is designed so as to yield a declarative a...
Program parallelization requires mapping computation and data to processing elements. Navigational Programming (NavP), based on the principle of migrating computations, offers a d...
Lei Pan, Jingling Xue, Ming Kin Lai, Michael B. Di...
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
Paola Bertolazzi, Giuseppe Di Battista, Carlo Mann...