지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국전산응용수학회 The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A 제8권 제2호
- 발행연도
- 2001.1
- 수록면
- 387 - 401 (15page)
이용수
초록· 키워드
오류제보하기
If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM. AMS Mathematics Subject Classification : 68Q22, 68Q25, 68R10
목차
등록된 정보가 없습니다.
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Domination in graphs of minimum degree four
대한수학회지
2009 .01
-
CENTRAL VERTICES AND ECCENTRIC GRAPHS
Journal of applied mathematics & computing
2007 .01
-
AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS
Journal of applied mathematics & computing
2005 .01
-
AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2007 .01
-
AN OPTIMAL PRAM ALGORITHM FOR A SPANNING TREE ON TRAPEZOID GRAPHS
Journal of applied mathematics & computing
2003 .01
-
EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
1998 .01
-
A correction to a paper on Roman κ-domination in graphs
대한수학회보
2013 .01
-
COMPUTER SIMULATION OF GRAIN GROWTH USING A TWO DIMENSIONAL VERTEX MODEL
대한지질학회 학술대회
1999 .11
-
On Comaximal Graphs of Near-rings
Kyungpook Mathematical Journal
2009 .01
-
THE GEODETIC NUMBER OF A GRAPH
Journal of applied mathematics & computing
2004 .01
-
On pathos block line cut-vertex graph of a tree
대한수학회논문집
2020 .01
-
Embedding distance graphs in finite field vector spaces
대한수학회지
2019 .01
-
THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
대한수학회지
2011 .01
-
Pick two points in a tree
대한수학회지
2019 .01
-
AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS
The Korean journal of computational & applied mathematics, 한국전산응용수학술지 Series A
1999 .01
-
RESOLUTION OF UNMIXED BIPARTITE GRAPHS
대한수학회보
2015 .01
-
A proper total coloring distinguishing adjacent vertices by sums of some product graphs
대한수학회논문집
2015 .01
-
SUPER VERTEX MEAN GRAPHS OF ORDER ≤ 7
Journal of applied mathematics & informatics
2017 .01
-
A NEW VERTEX-COLORING EDGE-WEIGHTING OF COMPLETE GRAPHS
Journal of applied mathematics & informatics
2014 .01
-
NUMBER OF VERTICES FOR POLYGONAL FUNCTIONS UNDER ITERATION
순수 및 응용수학
2007 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0