Journal of the Korean Institute of Telematics and Electronics B (전자공학회논문지B)
- Volume 30B Issue 1
- /
- Pages.10-17
- /
- 1993
- /
- 1016-135X(pISSN)
Parallel Algorithm for Determining Connectedness of Context Free Graph Languages
CFGL 연결성 결정에 대한 병렬 알고리듬
Abstract
This paper analyzes succinct graph descriptions and its complexity of connectivity problems on context free graph languages under various restrictions. It defines SNLC(Simple Context Free Node Label Controlled) grammar and presents reduction method that solves graph problems without expanding the hierarchical description. It exemplifies the method by giving efficient solutions to connectivity problems on graphs and presents parallel algorithm for reduction and analyzes the complexity. Its results will help application of desing for NETWORK. CAD. VLSI and other engineering problems.
Keywords