Search alternatives:
significant application » significant applications (Expand Search), significant implications (Expand Search), significant association (Expand Search)
application graphs » application rates (Expand Search), application rate (Expand Search), application range (Expand Search)
non decrease » point decrease (Expand Search), note decreased (Expand Search), fold decrease (Expand Search)
nn decrease » _ decrease (Expand Search), a decrease (Expand Search), mean decrease (Expand Search)
significant application » significant applications (Expand Search), significant implications (Expand Search), significant association (Expand Search)
application graphs » application rates (Expand Search), application rate (Expand Search), application range (Expand Search)
non decrease » point decrease (Expand Search), note decreased (Expand Search), fold decrease (Expand Search)
nn decrease » _ decrease (Expand Search), a decrease (Expand Search), mean decrease (Expand Search)
-
21
-
22
-
23
-
24
-
25
-
26
-
27
-
28
-
29
-
30
-
31
-
32
-
33
-
34
-
35
-
36
-
37
-
38
-
39
-
40
A graph with maximum cut.
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. …”