메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 69, Issue 3, 1996, Pages 281-289
On strongly connected digraphs with bounded cycle length
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0012297449     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00105-Z     Document Type: Article
Times cited : (37)
References (4)
  • 1
    • 0011560546 scopus 로고
    • The transitive reduction of a directed graph
    • A.V. Aho, M.R. Garey and J.D. Ullman, The transitive reduction of a directed graph, SIAM J. Comput. 1 (1972) 131-137.
    • (1972) SIAM J. Comput. , vol.1 , pp. 131-137
    • Aho, A.V.1    Garey, M.R.2    Ullman, J.D.3
  • 2
    • 0000504885 scopus 로고
    • Easy problems for tree-decomposable graphs
    • S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991) 308-340.
    • (1991) J. Algorithms , vol.12 , pp. 308-340
    • Arnborg, S.1    Lagergren, J.2    Seese, D.3
  • 4
    • 0001009871 scopus 로고
    • 5/2 algorithm for maximum matching in bipartite graphs
    • 5/2 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
    • (1973) SIAM J. Comput. , vol.2 , pp. 225-231
    • Hopcroft, J.E.1    Karp, R.M.2

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