A linear time algorithm for the 3-edge-connectivity augmentation problem for specified vertices of a graph with degree-unchangeable ones

2 Citations

Journal

Citations (2)*help

See more

Details 詳細情報について

  • CRID
    1571135650082337024
  • NII Article ID
    10013059085
  • Data Source
    • CiNii Articles

Report a problem

Back to top