• Title of article

    On the sets of perfect matchings for two bipartite graphs

  • Author/Authors

    Arnold Rosenbloom، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 1999
  • Pages
    3
  • From page
    95
  • To page
    97
  • Keywords
    Circuit complexity , Matching , computational complexity
  • Journal title
    Information Processing Letters
  • Serial Year
    1999
  • Journal title
    Information Processing Letters
  • Record number

    129073

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