메뉴 건너뛰기




Volumn 16, Issue 6, 1973, Pages 372-378

Algorithm 447: Efficient algorithms for graph manipulation

Author keywords

analysis of algorithms; graph manipulation; graphs

Indexed keywords


EID: 84976669902     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362248.362272     Document Type: Article
Times cited : (869)

References (7)
  • 1
    • 33745159104 scopus 로고
    • Computer recognition and extraction of planar graphs from the incidence matrix
    • June
    • Fisher, G.J. Computer recognition and extraction of planar graphs from the incidence matrix. IEEE Trans, in Circuit Theory CT-13, (June 1966), 154-163.
    • (1966) IEEE Trans, in Circuit Theory CT-13 , pp. 154-163
    • Fisher, G.J.1
  • 2
    • 0003780715 scopus 로고
    • Addison-Wesley, Reading, Mass.
    • Harary, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
    • (1969) Graph Theory
    • Harary, F.1
  • 3
    • 84976783158 scopus 로고    scopus 로고
    • On the time required to detect cycles and connectivity in directed graphs
    • Cornell U. Ithaca, N.Y.
    • Holt, R., and Reingold, E. On the time required to detect cycles and connectivity in directed graphs. Comput. Sci. TR 70-33, Cornell U. Ithaca, N.Y.
    • Comput. Sci. TR 70-33
    • Holt, R.1    Reingold, E.2
  • 6
    • 0015097714 scopus 로고
    • An algorithm for the blocks and cutnodes of a graph
    • July
    • Paton, K. An algorithm for the blocks and cutnodes of a graph. Comm. ACM 14, 7 (July 1971), 428-475.
    • (1971) Comm. ACM 14 , vol.7 , pp. 428-475
    • Paton, K.1
  • 7
    • 77956706312 scopus 로고
    • Implementation and analysis of efficient graph planarity testing
    • Madison, Wis.
    • Shirey, R.W. Implementation and analysis of efficient graph planarity testing. Ph.D. diss., Comput. Sci. Dep., U. of Wisconsin, Madison, Wis., 1969.
    • (1969) Ph.D. diss., Comput. Sci. Dep., U. of Wisconsin
    • Shirey, R.W.1


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