Showing 21 - 40 results of 9,234 for search '(( significant ((new decrease) OR (nn decrease)) ) OR ( significant application graphs ))', query time: 0.92s Refine Results
  1. 21
  2. 22
  3. 23
  4. 24
  5. 25
  6. 26
  7. 27
  8. 28
  9. 29
  10. 30
  11. 31
  12. 32
  13. 33
  14. 34
  15. 35
  16. 36
  17. 37

    A graph with maximum cut. by Md. Rafiqul Islam (403453)

    Published 2024
    “…Although it is an elementary graph partitioning problem, it is one of the most challenging combinatorial optimization-based problems, and tons of application areas make this problem highly admissible. …”
  18. 38

    A random graph configuration. by Md. Rafiqul Islam (403453)

    Published 2024
    “…Although it is an elementary graph partitioning problem, it is one of the most challenging combinatorial optimization-based problems, and tons of application areas make this problem highly admissible. …”
  19. 39
  20. 40