Efficient Parallel Algorithms for Shortest Paths in Planar Graphs C.T.I. Technical Report TR. 90.01.02

Παρόμοια τεκμήρια

• Computing Shortest Paths and Distances in Planar Graphs [C.T.I.] Technical Report TR 90.10.26
  ανά: Djidjeu, Hristo N., κ.ά.
  Έκδοση: (1990)
• Coloring Random Graphs Efficiently in Parallel, through Adaptive Techniques. [C.T.I.] Technical Report TR 90.10.25
  ανά: Ζαρολιάγκης, Χρήστος, κ.ά.
  Έκδοση: (1990)
• Optimal parallel Algorithms for Sparce Graphs C.T.I. Technical Report TR.90.04.07
  ανά: Ζαρολιάγκης, Χρήστος, κ.ά.
  Έκδοση: (1990)
• Fast Parallel Algorithms for Coloring Random Graphs [C.T.I.] Technical Report TR 90.11.32
  ανά: Kedem, Zui M., κ.ά.
  Έκδοση: (1990)
• Efficient Range Searching in a set of planar line Segments [C.T.I. Technical Reports] TR. 90.08.20
  ανά: Μπιστιόλας, Βαγγέλης, κ.ά.
  Έκδοση: (1990)