지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국전산응용수학회 The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A 제9권 제2호
- 발행연도
- 2002.1
- 수록면
- 607 - 620 (14page)
이용수
초록· 키워드
오류제보하기
In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
WHAT CAN WE SAY ABOUT THE TIME COMPLEXITY OF ALGORITHMS \ulcorner
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
-
AN ECHO CANCELLATION ALGORITHM FOR REDUCING THE HARDWARE COMPLEXITIES AND ANALYSIS ON ITS CONVERGENCE CHARACTERISTICS
Journal of applied mathematics & computing
2006 .01
-
Solving Molecular Distance Geometry Problems using Cliques and Shortest Path Algorithm
한국산업응용수학회 학술대회 논문집
2012 .05
-
NEW COMPLEXITY ANALYSIS OF IPM FOR P*(K) LCP BASED ON KERNEL FUNCTIONS
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2008 .12
-
ANALYSIS OF THE UPPER BOUND ON THE COMPLEXITY OF LLL ALGORITHM
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2016 .06
-
MODIFIED MULTIPLICATIVE UPDATE ALGORITHMS FOR COMPUTING THE NEAREST CORRELATION MATRIX
Journal of applied mathematics & informatics
2012 .01
-
New complexity analysis of primal-dual IMPS for P_(*) LAPS based on large updates
대한수학회보
2009 .01
-
Effect of Representation Methods on Time Complexity of Genetic Algorithm based Task Scheduling for Heterogeneous Network Systems
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
1997 .12
-
A Comparison of Numerical Stability of PLS1 Algorithms
Journal of The Korean Data Analysis Society
2011 .01
-
Non-Iterative Harmonic Bz Algorithm with Correction
한국산업응용수학회 학술대회 논문집
2013 .05
-
EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
1998 .01
-
Efficient Algorithms to Generate Elemental Images in Integral Imaging
Current Optics and Photonics
2004 .09
-
New Algorithms in Information Science
한국산업응용수학회 학술대회 논문집
2009 .05
-
AN EFFICIENT LINE-DRAWING ALGORITHM USING MST
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
2000 .01
-
Introduction to Algorithms for Solving Nonlinear Matrix Equations
한국산업응용수학회 학술대회 논문집
2004 .12
-
SEQUENTIAL AND PARALLEL ALGORITHMS FOR MINIMUM FLOWS
Journal of applied mathematics & computing
2004 .01
-
AN ABS ALGORITHM FOR SOLVING SINGULAR NONLINEAR SYSTEMS WITH RANK DEFECTS
Journal of applied mathematics & computing
2003 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0