Sciweavers

852 search results - page 60 / 171
» Using graph parsing for automatic graph drawing
Sort
View
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 2 months ago
Large graph processing in the cloud
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...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
INFORMS
2010
147views more  INFORMS 2010»
14 years 7 months ago
Exact Algorithms for the Quadratic Linear Ordering Problem
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
MOZ
2004
Springer
15 years 3 months ago
The XDG Grammar Development Kit
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...
Ralph Debusmann, Denys Duchier, Joachim Niehren
ICPP
2007
IEEE
15 years 4 months ago
Toward Automatic Data Distribution for Migrating Computations
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...
ESA
1993
Springer
109views Algorithms» more  ESA 1993»
15 years 2 months ago
Optimal Upward Planarity Testing of Single-Source Digraphs
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...