E cient Parallel Algorithms for Two Graph Layout Problems

@inproceedings{He1991ECP,
  title={E cient Parallel Algorithms for Two Graph Layout Problems},
  author={Xin He},
  year={1991}
}
We present e cient parallel algorithms for solving two graph layout problems: Find a F ary Embedding on a grid and construct a rectangular dual for planar graphs. The algorithm for the rst problem takes O(logn log n) time with O(n) processors on a PRAM. The algorithm for the second problem takes O(log 2 n) time with O(n) processors. 

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

On Finding the Rectangular Duals of Planar Triangular Graphs

  • SIAM J. Comput.
  • 1993
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

On Computing Straight-line Embeddings of Planar Graphs

M. F urer, B. Raghavachari
  • E ciently in Parallel,
  • 1990
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Embedding Planar Graphs on the Grid

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Planar graphs and poset dimension

VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

E cient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs

X. He
  • Algorithmica 5
  • 1990
VIEW 1 EXCERPT

An optimal parallel algorithm for graph planarity

  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…