지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국전산응용수학회 Journal of applied mathematics & computing Journal of applied mathematics & computing 제17권 제1호
- 발행연도
- 2005.1
- 수록면
- 1 - 23 (23page)
이용수
초록· 키워드
오류제보하기
The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
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
-
Solving Molecular Distance Geometry Problems using Cliques and Shortest Path Algorithm
한국산업응용수학회 학술대회 논문집
2012 .05
-
DISTRIBUTED ALGORITHMS SOLVING THE UPDATING PROBLEMS
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
2002 .01
-
Domination in graphs of minimum degree four
대한수학회지
2009 .01
-
AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2007 .01
-
CENTRAL VERTICES AND ECCENTRIC GRAPHS
Journal of applied mathematics & computing
2007 .01
-
THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
대한수학회지
2011 .01
-
AN OPTIMAL PRAM ALGORITHM FOR A SPANNING TREE ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2003 .01
-
SUPER VERTEX MEAN GRAPHS OF ORDER ≤ 7
Journal of applied mathematics & informatics
2017 .01
-
EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
1998 .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 ALGORITHM TO FIND A MAXIMUM MATCHING OF A TRAPEZOID GRAPH
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2005 .12
-
NEW CONCEPTS OF REGULAR INTERVAL-VALUED FUZZY GRAPHS
Journal of applied mathematics & informatics
2017 .01
-
APPLICATIONS OF GRAPH THEORY
JOURNAL OF THE KOREAN SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
2007 .12
-
Total domination number of central graphs
대한수학회보
2019 .01
-
On Comaximal Graphs of Near-rings
Kyungpook Mathematical Journal
2009 .01
-
A NEW VERTEX-COLORING EDGE-WEIGHTING OF COMPLETE GRAPHS
Journal of applied mathematics & informatics
2014 .01
-
RADIO NUMBER OF TRANSFORMATION GRAPHS OF A PATH
Journal of applied mathematics & informatics
2017 .01
-
AN EXTENSION OF SALLEE'S THEOREM TO INFINITE LOCALLY FINITE VAP-FREE PLANE GRAPHS
Journal of applied mathematics & computing
2006 .01
-
PLANE EMBEDDING PROBLEMS AND A THEOREM FOR INFINITE MAXIMAL PLANAR GRAPHS
Journal of applied mathematics & computing
2005 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0