Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to so...
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
https://www.riss.kr/link?id=A100592969
1999
English
KCI등재
학술저널
727-734(8쪽)
0
상세조회0
다운로드다국어 초록 (Multilingual Abstract)
Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to so...
Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.
A NEW HASH FUNCTION-SMD(STRENCGTHEND MESSAGE DIGEST) AND ITS APPLICATION TO MAC
CONCERNING THE RADIUS OF CONVERGENCE OF NEWTON'S METHOD AND APPLICATIONS
A SOLVER FOR LARGE-SCALE INDEFINITE QUADRATIC PROGRAMS