774 search results - page 2 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
HOTI
2008
IEEE
14 years 2 months ago
2008
IEEE
ESA
1993
Springer
13 years 11 months ago
1993
Springer
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 ...
PLDI
2011
ACM
12 years 10 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
TCS
2008
13 years 7 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...