지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국전산응용수학회 The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A 제5권 제1호
- 발행연도
- 1998.1
- 수록면
- 141 - 152 (12page)
이용수
초록· 키워드
오류제보하기
Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS
Journal of applied mathematics & computing
2005 .01
-
AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
1999 .01
-
AN OPTIMAL PRAM ALGORITHM FOR A SPANNING TREE ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2003 .01
-
THE OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE ALL HINGE VERTICES ON INTERVAL GRAPHS
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
2001 .01
-
AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS
Journal of applied mathematics & computing
2005 .01
-
ON ORIENTED 2-FACTORABLE GRAPHS
Journal of applied mathematics & computing
2005 .01
-
AN ALGORITHM TO FIND A MAXIMUM MATCHING OF A TRAPEZOID GRAPH
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2005 .12
-
AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2007 .01
-
GROUP OF POLYNOMIAL PERMUTATIONS OF ？
호남수학학술지
2012 .01
-
THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
대한수학회지
2011 .01
-
Total domination number of central graphs
대한수학회보
2019 .01
-
SUPER VERTEX MEAN GRAPHS OF ORDER ≤ 7
Journal of applied mathematics & informatics
2017 .01
-
THE BOUNDARIES OF DIPOLE GRAPHS AND THE COMPLETE BIPARTITE GRAPHS K
호남수학학술지
2014 .01
-
On co-well covered graphs
대한수학회논문집
2020 .01
-
MINIMAL GENERALIZED PERMUTATIONS
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
2000 .01
-
On rings whose annihilating-ideal graphs are blow-ups of a class of Boolean graphs
대한수학회지
2017 .01
-
SOME NEW RESULTS ON IRREGULARITY OF GRAPHS
Journal of applied mathematics & informatics
2014 .01
-
HAMILTONIAN INSERTED GRAPHS AND SQUARES
충청수학회지
2006 .01
-
All generalized Petersen graphs are unit-distance graphs
대한수학회지
2012 .01
-
Efficient Mining of Frequent Subgraph with Connectivity Constraint
한국생물정보시스템생물학회 학술대회
2005 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0