wiki_research

commit 16fc9000b8b8ce723e443b6012e20fa49e9d5906
parent 1e366736db896bfd6949c8afba0470d1b1dbf729
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 30 Jul 2025 00:30:42 +0200

commit with codex

Diffstat:
graph_bandwidth
 | 
11
+++++++++++
maximum
 | 
2
+-
minimization
 | 
2
+-

3 files changed, 13 insertions(+), 2 deletions(-)
diff --git a/graph_bandwidth b/graph_bandwidth
@@ -0,0 +1,11 @@
+# Graph bandwidth
+
+https://en.wikipedia.org/wiki/Graph_bandwidth
+
+Label the [vertices] of a [graph] with [integers] so as to [minimize] the [maximal] difference between the images of two adjacent [vertices]
+
+The [computational_problem] of computing it is [NP_hard]
+
+Up: [width_measure]
+
+See also: [graph_antibandwidth], [cutwidth]
diff --git a/maximum b/maximum
@@ -7,4 +7,4 @@ See also: [minimum], [maximization_problem]
 
 Up: [mathematics_basic_concepts]
 
-Aliases: max
+Aliases: max, maximal
diff --git a/minimization b/minimization
@@ -6,6 +6,6 @@
 
 Up: [theoretical_computer_science]
 
-Aliases: minimized
+Aliases: minimized, minimize
 
 See also: [minimum], [maximization]