• Title of article

    A simplified correctness proof for a well-known algorithm computing strongly connected components

  • Author/Authors

    Ingo Wegener، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2002
  • Pages
    3
  • From page
    17
  • To page
    19
  • Keywords
    Graph problems , Algorithms , Depth first search , Strongly connected components
  • Journal title
    Information Processing Letters
  • Serial Year
    2002
  • Journal title
    Information Processing Letters
  • Record number

    129536

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129536