메뉴 건너뛰기




Volumn 47, Issue 1, 1998, Pages 6-7

Most-vital edge of a graph with respect to spanning trees

Author keywords

Matrix operations; Most vital edges; Number of spanning trees; Reliability optimization; Resistance network

Indexed keywords

MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; RELIABILITY;

EID: 0032020847     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.690884     Document Type: Article
Times cited : (16)

References (2)
  • 1
    • 0028740491 scopus 로고
    • Finding the most vital edges with respect to the number of spanning trees"
    • Dec
    • F.P.Tsen, T.Sung, M.Lin, et al, "Finding the most vital edges with respect to the number of spanning trees", IEEE Trans. Reliability, vol 43, 1994 Dec, pp 600-602.
    • (1994) IEEE Trans. Reliability , vol.43 , pp. 600-602
    • Tsen, F.P.1    Sung, T.2    Lin, M.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.