Journal of KIISE:Computer Systems and Theory (한국정보과학회논문지:시스템및이론)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

(An O(log n) Parallel-Time Depth-First Search Algorithm for Solid Grid Graphs

O(log n)의 병렬 시간이 소요되는 Solid Grid 그래프를 위한 Depth-First Search 알고리즘

  • 허준호 (광주과학기술원 정보통신공학과) ;
  • 발행 : 2006.07.01
Download PDF
⟨ Previous Next ⟩

초록

We extend a parallel depth-first search (DFS) algorithm for planar graphs to deal with (non-planar) solid grid graphs, a subclass of non-planar grid graphs. The proposed algorithm takes time O(log n) with $O(n/sqrt{log\;n})$ processors in Priority PRAM model. In our knowledge, this is the first deterministic NC algorithm for a non-planar graph class.

본 논문은 평면 그래프를 위한 병렬 depth-first search (DFS) 알고리즘 [SIAM J. Comput., 19 (1990) 678-704]을 비 평면일 (non-planar) 수 있는 grid 그래프의 한 종류인 solid grid 그래프에 대해서도 수행 가능하도록 확장된 알고리즘을 제안한다. 제안 알고리즘은 Priority PRAM 모델에서 $O(n/sqrt{log\;n})$개의 프로세서로 수행했을 때 O(log n)의 병렬 시간이 소요된다. 우리의 지식으로, 이는 비 평면 그래프를 위한 첫 번째 결정적 NC (deterministic NC) 알고리즘이다.

키워드

참고문헌

  1. V. Ramachandran, Parallel open ear decomposition with applications to graph biconnectivity, and triconnectivity, in Synthesis of Parallel Algorithms, J. Reif, ed., Morgan-Kaufmann, pp. 275-340, 1993
  2. R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput., Vol.1, No.2, pp.146-160, 1972 https://doi.org/10.1137/0201010
  3. E. Charniak and D. McDermott, Introduction to artificial intelligence, Addison-Wesley, 1985
  4. E. Reghgati and D. Corneil, Parallel computations in graph theory, SIAM J. Comput., Vol.7, No.3, pp.230-237, 1978 https://doi.org/10.1137/0207020
  5. J. H. Reif, Depth-first searches inherently sequential, Inform. Process. Lett., Vol.20, No.5, pp.229-234, 1985 https://doi.org/10.1016/0020-0190(85)90024-9
  6. A. Aggarwal and R. J. Anderson, A random NC algorithm for depth-first search, Combinatorica, Vol.8, No.1, pp.1-12, 1988 https://doi.org/10.1007/BF02122548
  7. A. Aggarwal, Richard J. Anderson, and Ming-Yang Kao, Parallel depth-first search in general directed graphs, SIAM J. Comput., Vol.19, No.2, pp.397-409, 1990 https://doi.org/10.1137/0219025
  8. Jun-Ho Her and R. S. Ramakrishna, External-memory depth-first search algorithm for solid grid graphs, Information Processing Letters, Vol.93, No.4, pp.177 -183, 2005 https://doi.org/10.1016/j.ipl.2004.09.025
  9. J. R. Smith, Parallel algorithms for depth-first searches I. Planar graphs, SIAM J. Comput., Vol.15, No.3, pp.814-830, 1986 https://doi.org/10.1137/0215058
  10. A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Discrete Math., Vol.1, No.1, pp.434-446, 1988 https://doi.org/10.1137/0401044
  11. G. E. Shannon, A linear-processor algorithm for depth-first search in planar graphs, Inform. Process. Lett., Vol.29, No.3, pp.119-123, 1988 https://doi.org/10.1016/0020-0190(88)90048-8
  12. T. Hagerup, Planar depth-first search in O(log n) parallel time, SIAM J. Comput., Vol.l9, No.4, pp.678-704, 1990 https://doi.org/10.1137/0219047
  13. Ming-Yang Kao, Shang-Hua Teng, and K. Toyama, An optimal parallel algorithm for planar cycle separators, Proc. of the 3rd Int. Workshop on Algorithms and Data Structures, pp.407-420, 1993
  14. Greg N. Frederickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM J. Comput, Vol.16, No.6, pp.1004-1022, 1987 https://doi.org/10.1137/0216064
  15. L. Arge, L. Toma, and J. S. Vitter, 'I/O-Efficient Algorithms for Problems on Grid-based Terrains,' Journal of Experimental Algorithms, Vol.6, No.1, pp.1-19, 2001 https://doi.org/10.1145/945394.945395