diff --git a/algorithms/DFS.md b/algorithms/DFS.md index 7fda9724b..aea283730 100644 --- a/algorithms/DFS.md +++ b/algorithms/DFS.md @@ -1,11 +1,7 @@ --- title: Depth First Search Algorithm and Tree Properties category: algorithms -tags: - - graph theory - - depth first search - - spanning trees - - graph traversal +tags: graph theory, depth first search, spanning trees, graph traversal description: A technical explanation of Depth First Search (DFS) algorithm and its tree properties, including both recursive and iterative implementations. The document covers key properties of DFS trees, including the ancestor-descendant relationship of non-tree edges, and includes a formal lemma and proof about DFS tree characteristics. --- diff --git a/algorithms/approximation-algorithms.md b/algorithms/approximation-algorithms.md index 48011053c..96b815044 100644 --- a/algorithms/approximation-algorithms.md +++ b/algorithms/approximation-algorithms.md @@ -1,11 +1,7 @@ --- title: Approximation Algorithms category: algorithms -tags: - - approximation - - algorithms - - vertex cover - - set cover +tags: approximation, algorithms, vertex cover, set cover description: A survey of approximation algorithms, including the 2-approximation for vertex cover and the log(n) approximation for set cover. --- diff --git a/algorithms/bipartite-graphs.md b/algorithms/bipartite-graphs.md index 10eaf3f0a..5ed5a7351 100644 --- a/algorithms/bipartite-graphs.md +++ b/algorithms/bipartite-graphs.md @@ -1,11 +1,7 @@ --- title: Bipartite Graphs Properties, Proofs, and Detection Algorithm category: Graph Theory -tags: - - bipartite graphs - - graph coloring - - odd cycles - - breadth-first search +tags: bipartite graphs, graph coloring, odd cycles, breadth-first search description: A comprehensive overview of bipartite graphs, including their formal definition and key properties related to vertex coloring and odd-length cycles. The document presents important lemmas about the relationship between bipartite graphs and odd cycles, along with proofs using BFS layer analysis for bipartite graph detection. --- diff --git a/algorithms/connected-components.md b/algorithms/connected-components.md index f378493e9..b33358c36 100644 --- a/algorithms/connected-components.md +++ b/algorithms/connected-components.md @@ -1,11 +1,7 @@ --- title: Finding Connected Components in Undirected Graphs Using BFS/DFS category: algorithms -tags: - - graph theory - - connected components - - breadth-first search - - depth-first search +tags: graph theory, connected components, breadth-first search, depth-first search description: Explains how to partition an undirected graph into connected components using BFS or DFS algorithms in O(|V| + |E|) time complexity. Includes Python implementation using adjacency lists and demonstrates how to create a data structure that enables O(1) time queries for path existence between vertices. --- diff --git a/algorithms/dynamic-programming.md b/algorithms/dynamic-programming.md index 0a0329cb9..873560f20 100644 --- a/algorithms/dynamic-programming.md +++ b/algorithms/dynamic-programming.md @@ -1,11 +1,7 @@ --- title: Dynamic Programming Algorithms and Problem Solutions Guide category: algorithms -tags: - - dynamic-programming - - optimization - - algorithm-analysis - - problem-solving +tags: dynamic-programming, optimization, algorithm-analysis, problem-solving description: A comprehensive guide covering various dynamic programming algorithms and their implementations, including knapsack, sequence alignment, and tree-based problems. Includes detailed explanations of problem-solving approaches, correctness proofs, and runtime analysis for each algorithm, with practical Python implementations. --- diff --git a/algorithms/graphs-intro.md b/algorithms/graphs-intro.md index 8d8bf299c..90a9f3ec9 100644 --- a/algorithms/graphs-intro.md +++ b/algorithms/graphs-intro.md @@ -1,11 +1,7 @@ --- title: Introduction to Undirected Graphs and Their Properties category: Graph Theory -tags: - - graph fundamentals - - graph representation - - graph properties - - data structures +tags: graph, graph fundamentals, graph representation, graph properties, data structures description: A comprehensive introduction to undirected graphs covering fundamental concepts, properties, and storage methods. The document explains key terminology, proves important theorems about degree sums and odd vertices, and compares adjacency matrix and list representations with their respective time and space complexities. --- diff --git a/algorithms/greedy-algorithms.md b/algorithms/greedy-algorithms.md index 7398673cc..c4adaca93 100644 --- a/algorithms/greedy-algorithms.md +++ b/algorithms/greedy-algorithms.md @@ -1,22 +1,17 @@ --- title: Greedy Algorithms for Interval Scheduling and Partitioning category: Algorithm Analysis -tags: - - Greedy Algorithms - - Interval Scheduling - - Interval Partitioning - - Proof Techniques - - Optimization +tags: algorithms, interval, scheduling, partitioning, greedy-algorithms description: This document explores greedy algorithms for interval scheduling and partitioning problems. It provides detailed explanations of the algorithms, including Python implementations, and presents rigorous proofs of correctness using techniques such as "Greedy Stays Ahead" and exchange arguments. --- - # Greedy Algorithms +# Greedy Algorithms Choose the most attractive choice at each step, and hope that this will lead to the optimal solution. Proofs of correctness are particularly important for greedy algorithms. - ## Interval Scheduling +## Interval Scheduling - Job $j$ starts at $s(j)$ and finishes at $f(j)$. Two jobs are compatible if they don't overlap. The goal is to schedule as many jobs as possible without overlapping. +Job $j$ starts at $s(j)$ and finishes at $f(j)$. Two jobs are compatible if they don't overlap. The goal is to schedule as many jobs as possible without overlapping. Start by sorting the jobs with $f(j)$, and iterate over the jobs in order and choose as many jobs as you can. @@ -36,17 +31,17 @@ def interval_scheduling(jobs): Suppose the above algorithm has chosen jobs $f(i_1) \le f(i_2) \le \ldots \le f(i_k)$, and suppose $f(j_1) \le f(j_2) \le \ldots \le f(j_m)$. -*Goal:* $m \le k$ +_Goal:_ $m \le k$ -*Lemma*: $\forall r$, $f(i_r) \le f(j_r)$ +_Lemma_: $\forall r$, $f(i_r) \le f(j_r)$ -*Proof*: Induction, $P(r) := f(i_r) \le f(j_r)$ +_Proof_: Induction, $P(r) := f(i_r) \le f(j_r)$ -*Base Case*: $P(1)$. $i_1$ has the smallest finishing time. +_Base Case_: $P(1)$. $i_1$ has the smallest finishing time. -*IH*: Assume $P(r - 1)$ +_IH_: Assume $P(r - 1)$ -*IS*: Goal $P(r)$ +_IS_: Goal $P(r)$ Applying $P(r - 1)$, and using the fact that both sets of jobs chosen are non-overlapping within themselves, we have... @@ -99,6 +94,6 @@ def partition_intervals(I: list[tuple[int, int]]): Let $d$ be the number of classrooms the greedy algorithm uses. Classroom $d$ is then allocated because we needed to schedule a job, $j$, that is incompatible with all $d - 1$ previously allocated classrooms. -Since we sorted by start time, all these incompatible jobs must have started before $s(j)$, and thus we have $d$ lectures overlapping at time $s(j) + \epsilon$, so our maximum depth is $\ge d$. +Since we sorted by start time, all these incompatible jobs must have started before $s(j)$, and thus we have $d$ lectures overlapping at time $s(j) + \epsilon$, so our maximum depth is $\ge d$. Since we have that the optimal solution must schedule at least depth number of classrooms, we have that the greedy algorithm is optimal. diff --git a/algorithms/induction.md b/algorithms/induction.md index add452e87..c00efffa4 100644 --- a/algorithms/induction.md +++ b/algorithms/induction.md @@ -1,12 +1,7 @@ --- title: Mathematical Induction and Pigeonhole Principle Proofs category: Mathematics -tags: - - Induction - - Pigeonhole Principle - - Proof Techniques - - Number Theory - - Combinatorics +tags: induction, pigeonhole principle, proof techniques description: This document presents detailed proofs using mathematical induction and the pigeonhole principle. It demonstrates the inductive proof for the sum of natural numbers and provides a step-by-step proof of the pigeonhole principle, emphasizing the general approach to inductive reasoning in mathematics. --- diff --git a/algorithms/linear-programming.md b/algorithms/linear-programming.md index 4a9ad8595..c08068805 100644 --- a/algorithms/linear-programming.md +++ b/algorithms/linear-programming.md @@ -1,12 +1,7 @@ --- title: Linear Programming Fundamentals and Applications in Optimization category: Operations Research -tags: - - Linear Systems - - Linear Programs - - Optimization - - Standard Form - - Application Examples +tags: linear systems, linear programs, optimization description: This document provides a comprehensive overview of linear programming, covering linear systems, linear programs, and their standard forms. It explains key concepts such as hyperplanes, polytopes, and convex sets, and demonstrates how to transform various optimization problems into linear programs. The document also explores practical applications of linear programming in areas like max-flow and weighted vertex cover problems. --- diff --git a/algorithms/network-flows.md b/algorithms/network-flows.md index 70005004e..a7b443014 100644 --- a/algorithms/network-flows.md +++ b/algorithms/network-flows.md @@ -1,12 +1,7 @@ --- title: Network Flow Algorithms and Applications in Graph Theory category: Graph Theory -tags: - - Max Flow Min Cut - - Ford-Fulkerson Algorithm - - Bipartite Matching - - Vertex Cover - - Independent Set +tags: max flow min cut, ford-fulkerson algorithm, bipartite matching, vertex cover, independent set description: Comprehensive overview of network flow algorithms, including Max Flow/Min Cut and Ford-Fulkerson. Covers applications in bipartite matching, vertex cover, and independent set problems. Includes proofs, algorithms, and problem-solving techniques for graph theory concepts. --- diff --git a/algorithms/runtime.md b/algorithms/runtime.md index d7c2a10ef..2a6dcfb00 100644 --- a/algorithms/runtime.md +++ b/algorithms/runtime.md @@ -1,11 +1,7 @@ --- title: Measuring Algorithm Efficiency with Asymptotic Notation category: Computer Science -tags: - - Algorithm Analysis - - Time Complexity - - Asymptotic Notation - - Efficiency Bounds +tags: algorithm, time complexity, asymptotic notation, efficiency description: This document introduces methods for measuring algorithm efficiency using asymptotic notation. It defines O-notation, Omega-notation, and Theta-notation, and provides common efficiency bounds for various function types, emphasizing the importance of polynomial-time algorithms in practical computing. --- diff --git a/algorithms/stable-matching.md b/algorithms/stable-matching.md index 09a721096..ea4582a15 100644 --- a/algorithms/stable-matching.md +++ b/algorithms/stable-matching.md @@ -1,3 +1,10 @@ +--- +title: Stable Matching Algorithms and Proofs in Computer Science +category: Algorithm Analysis +tags: matching, stable matching, gale-shapley, proof techniques, complexity analysis, optimization +description: This document provides a comprehensive overview of stable matching algorithms, focusing on the Gale-Shapley algorithm and its properties. It includes detailed proofs of correctness, complexity analysis, and discussions on optimal assignments for companies and applicants. The document also explores related problems like the Stable Roommate Problem. +--- + # Stable Matching Given a list of $n$ companies $c_1, c_2, \ldots, c_n$, and a list of students $s_1, s_2, \ldots, s_n$, each company ranks the students in order of preference, and each student ranks the companies in order of preference. diff --git a/algorithms/tree-intro.md b/algorithms/tree-intro.md index 584bd09c1..012caac31 100644 --- a/algorithms/tree-intro.md +++ b/algorithms/tree-intro.md @@ -1,12 +1,7 @@ --- title: Tree Properties and Proof of Edge Count category: Graph Theory -tags: - - Trees - - Acyclic Graphs - - Connected Graphs - - Induction Proofs - - Graph Properties +tags: trees, acyclic graphs, connected graphs, induction proofs, graph properties description: This document explores the fundamental properties of trees in graph theory. It provides a proof by induction that a tree with n vertices has n-1 edges and outlines three key properties of trees, demonstrating their interconnected nature. --- diff --git a/site/algorithms/DFS.html b/site/algorithms/DFS.html index acd77bf77..9fafdaa0e 100644 --- a/site/algorithms/DFS.html +++ b/site/algorithms/DFS.html @@ -4,7 +4,7 @@ Depth First Search Algorithm and Tree Properties - + + + + +
+ +

Tag: acyclic graphs

+
+ Last modified: 2025-01-01 + +
+
+

Tag: acyclic graphs

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/algorithm-analysis.html b/site/tags/algorithm-analysis.html new file mode 100644 index 000000000..b46a8138b --- /dev/null +++ b/site/tags/algorithm-analysis.html @@ -0,0 +1,193 @@ + + + + + + Tag: algorithm-analysis + + + + + +
+ +

Tag: algorithm-analysis

+
+ Last modified: 2025-01-01 + +
+
+

Tag: algorithm-analysis

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/algorithm.html b/site/tags/algorithm.html new file mode 100644 index 000000000..efb834d3b --- /dev/null +++ b/site/tags/algorithm.html @@ -0,0 +1,193 @@ + + + + + + Tag: algorithm + + + + + +
+ +

Tag: algorithm

+
+ Last modified: 2025-01-01 + +
+
+

Tag: algorithm

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/algorithms.html b/site/tags/algorithms.html new file mode 100644 index 000000000..19ecd82c1 --- /dev/null +++ b/site/tags/algorithms.html @@ -0,0 +1,194 @@ + + + + + + Tag: algorithms + + + + + +
+ +

Tag: algorithms

+
+ Last modified: 2025-01-01 + +
+
+

Tag: algorithms

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/approximation.html b/site/tags/approximation.html new file mode 100644 index 000000000..bae6ecd39 --- /dev/null +++ b/site/tags/approximation.html @@ -0,0 +1,193 @@ + + + + + + Tag: approximation + + + + + +
+ +

Tag: approximation

+
+ Last modified: 2025-01-01 + +
+
+

Tag: approximation

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/asymptotic notation.html b/site/tags/asymptotic notation.html new file mode 100644 index 000000000..185f559fb --- /dev/null +++ b/site/tags/asymptotic notation.html @@ -0,0 +1,193 @@ + + + + + + Tag: asymptotic notation + + + + + +
+ +

Tag: asymptotic notation

+
+ Last modified: 2025-01-01 + +
+
+

Tag: asymptotic notation

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/bipartite graphs.html b/site/tags/bipartite graphs.html new file mode 100644 index 000000000..d2e496f65 --- /dev/null +++ b/site/tags/bipartite graphs.html @@ -0,0 +1,193 @@ + + + + + + Tag: bipartite graphs + + + + + +
+ +

Tag: bipartite graphs

+
+ Last modified: 2025-01-01 + +
+
+

Tag: bipartite graphs

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/bipartite matching.html b/site/tags/bipartite matching.html new file mode 100644 index 000000000..56a7ac587 --- /dev/null +++ b/site/tags/bipartite matching.html @@ -0,0 +1,193 @@ + + + + + + Tag: bipartite matching + + + + + +
+ +

Tag: bipartite matching

+
+ Last modified: 2025-01-01 + +
+
+

Tag: bipartite matching

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/breadth-first search.html b/site/tags/breadth-first search.html new file mode 100644 index 000000000..62145a122 --- /dev/null +++ b/site/tags/breadth-first search.html @@ -0,0 +1,194 @@ + + + + + + Tag: breadth-first search + + + + + +
+ +

Tag: breadth-first search

+
+ Last modified: 2025-01-01 + +
+
+

Tag: breadth-first search

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/complexity analysis.html b/site/tags/complexity analysis.html new file mode 100644 index 000000000..2dbeac2de --- /dev/null +++ b/site/tags/complexity analysis.html @@ -0,0 +1,193 @@ + + + + + + Tag: complexity analysis + + + + + +
+ +

Tag: complexity analysis

+
+ Last modified: 2025-01-01 + +
+
+

Tag: complexity analysis

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/connected components.html b/site/tags/connected components.html new file mode 100644 index 000000000..989b39170 --- /dev/null +++ b/site/tags/connected components.html @@ -0,0 +1,193 @@ + + + + + + Tag: connected components + + + + + +
+ +

Tag: connected components

+
+ Last modified: 2025-01-01 + +
+
+

Tag: connected components

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/connected graphs.html b/site/tags/connected graphs.html new file mode 100644 index 000000000..f2ab4a290 --- /dev/null +++ b/site/tags/connected graphs.html @@ -0,0 +1,193 @@ + + + + + + Tag: connected graphs + + + + + +
+ +

Tag: connected graphs

+
+ Last modified: 2025-01-01 + +
+
+

Tag: connected graphs

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/data structures.html b/site/tags/data structures.html new file mode 100644 index 000000000..dd2287ed5 --- /dev/null +++ b/site/tags/data structures.html @@ -0,0 +1,193 @@ + + + + + + Tag: data structures + + + + + +
+ +

Tag: data structures

+
+ Last modified: 2025-01-01 + +
+
+

Tag: data structures

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/depth first search.html b/site/tags/depth first search.html new file mode 100644 index 000000000..bfcfdfb3a --- /dev/null +++ b/site/tags/depth first search.html @@ -0,0 +1,193 @@ + + + + + + Tag: depth first search + + + + + +
+ +

Tag: depth first search

+
+ Last modified: 2025-01-01 + +
+
+

Tag: depth first search

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/depth-first search.html b/site/tags/depth-first search.html new file mode 100644 index 000000000..c4f510bc5 --- /dev/null +++ b/site/tags/depth-first search.html @@ -0,0 +1,193 @@ + + + + + + Tag: depth-first search + + + + + +
+ +

Tag: depth-first search

+
+ Last modified: 2025-01-01 + +
+
+

Tag: depth-first search

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/dynamic-programming.html b/site/tags/dynamic-programming.html new file mode 100644 index 000000000..fc0c355fe --- /dev/null +++ b/site/tags/dynamic-programming.html @@ -0,0 +1,193 @@ + + + + + + Tag: dynamic-programming + + + + + +
+ +

Tag: dynamic-programming

+
+ Last modified: 2025-01-01 + +
+
+

Tag: dynamic-programming

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/efficiency.html b/site/tags/efficiency.html new file mode 100644 index 000000000..664149253 --- /dev/null +++ b/site/tags/efficiency.html @@ -0,0 +1,193 @@ + + + + + + Tag: efficiency + + + + + +
+ +

Tag: efficiency

+
+ Last modified: 2025-01-01 + +
+
+

Tag: efficiency

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/ford-fulkerson algorithm.html b/site/tags/ford-fulkerson algorithm.html new file mode 100644 index 000000000..3f12bacda --- /dev/null +++ b/site/tags/ford-fulkerson algorithm.html @@ -0,0 +1,193 @@ + + + + + + Tag: ford-fulkerson algorithm + + + + + +
+ +

Tag: ford-fulkerson algorithm

+
+ Last modified: 2025-01-01 + +
+
+

Tag: ford-fulkerson algorithm

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/gale-shapley.html b/site/tags/gale-shapley.html new file mode 100644 index 000000000..719d5469a --- /dev/null +++ b/site/tags/gale-shapley.html @@ -0,0 +1,193 @@ + + + + + + Tag: gale-shapley + + + + + +
+ +

Tag: gale-shapley

+
+ Last modified: 2025-01-01 + +
+
+

Tag: gale-shapley

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph coloring.html b/site/tags/graph coloring.html new file mode 100644 index 000000000..36a85d11c --- /dev/null +++ b/site/tags/graph coloring.html @@ -0,0 +1,193 @@ + + + + + + Tag: graph coloring + + + + + +
+ +

Tag: graph coloring

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph coloring

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph fundamentals.html b/site/tags/graph fundamentals.html new file mode 100644 index 000000000..e7c689682 --- /dev/null +++ b/site/tags/graph fundamentals.html @@ -0,0 +1,193 @@ + + + + + + Tag: graph fundamentals + + + + + +
+ +

Tag: graph fundamentals

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph fundamentals

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph properties.html b/site/tags/graph properties.html new file mode 100644 index 000000000..365527eeb --- /dev/null +++ b/site/tags/graph properties.html @@ -0,0 +1,194 @@ + + + + + + Tag: graph properties + + + + + +
+ +

Tag: graph properties

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph properties

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph representation.html b/site/tags/graph representation.html new file mode 100644 index 000000000..9499468e7 --- /dev/null +++ b/site/tags/graph representation.html @@ -0,0 +1,193 @@ + + + + + + Tag: graph representation + + + + + +
+ +

Tag: graph representation

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph representation

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph theory.html b/site/tags/graph theory.html new file mode 100644 index 000000000..b6f361682 --- /dev/null +++ b/site/tags/graph theory.html @@ -0,0 +1,194 @@ + + + + + + Tag: graph theory + + + + + +
+ +

Tag: graph theory

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph theory

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph traversal.html b/site/tags/graph traversal.html new file mode 100644 index 000000000..aaf33e623 --- /dev/null +++ b/site/tags/graph traversal.html @@ -0,0 +1,193 @@ + + + + + + Tag: graph traversal + + + + + +
+ +

Tag: graph traversal

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph traversal

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/graph.html b/site/tags/graph.html new file mode 100644 index 000000000..10d2b26c7 --- /dev/null +++ b/site/tags/graph.html @@ -0,0 +1,193 @@ + + + + + + Tag: graph + + + + + +
+ +

Tag: graph

+
+ Last modified: 2025-01-01 + +
+
+

Tag: graph

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/greedy-algorithms.html b/site/tags/greedy-algorithms.html new file mode 100644 index 000000000..29866b630 --- /dev/null +++ b/site/tags/greedy-algorithms.html @@ -0,0 +1,193 @@ + + + + + + Tag: greedy-algorithms + + + + + +
+ +

Tag: greedy-algorithms

+
+ Last modified: 2025-01-01 + +
+
+

Tag: greedy-algorithms

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/independent set.html b/site/tags/independent set.html new file mode 100644 index 000000000..e9f7fddd1 --- /dev/null +++ b/site/tags/independent set.html @@ -0,0 +1,193 @@ + + + + + + Tag: independent set + + + + + +
+ +

Tag: independent set

+
+ Last modified: 2025-01-01 + +
+
+

Tag: independent set

+ +
+ +
+ + \ No newline at end of file diff --git a/site/tags/index.html b/site/tags/index.html index b81326920..fda8c83dc 100644 --- a/site/tags/index.html +++ b/site/tags/index.html @@ -184,10 +184,58 @@

Tags

Tags

+
  • greedy-algorithms (1 pages)
  • +
  • independent set (1 pages)
  • +
  • induction (1 pages)
  • +
  • induction proofs (1 pages)
  • +
  • interval (1 pages)
  • +
  • linear programs (1 pages)
  • +
  • linear systems (1 pages)
  • +
  • matching (1 pages)
  • +
  • max flow min cut (1 pages)
  • +
  • odd cycles (1 pages)
  • +
  • optimization (3 pages)
  • +
  • partitioning (1 pages)
  • +
  • pigeonhole principle (1 pages)
  • +
  • problem-solving (1 pages)
  • +
  • proof techniques (2 pages)
  • +
  • scheduling (1 pages)
  • +
  • set cover (1 pages)
  • +
  • shortest-paths (1 pages)
  • +
  • spanning trees (1 pages)
  • +
  • stable matching (1 pages)
  • +
  • time complexity (1 pages)
  • +
  • trees (1 pages)
  • +
  • vertex cover (2 pages)
  • diff --git a/site/tags/induction proofs.html b/site/tags/induction proofs.html new file mode 100644 index 000000000..d99ca67e1 --- /dev/null +++ b/site/tags/induction proofs.html @@ -0,0 +1,193 @@ + + + + + + Tag: induction proofs + + + + + +
    + +

    Tag: induction proofs

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: induction proofs

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/induction.html b/site/tags/induction.html new file mode 100644 index 000000000..18494690c --- /dev/null +++ b/site/tags/induction.html @@ -0,0 +1,193 @@ + + + + + + Tag: induction + + + + + +
    + +

    Tag: induction

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: induction

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/interval.html b/site/tags/interval.html new file mode 100644 index 000000000..1c5dfbe40 --- /dev/null +++ b/site/tags/interval.html @@ -0,0 +1,193 @@ + + + + + + Tag: interval + + + + + +
    + +

    Tag: interval

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: interval

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/linear programs.html b/site/tags/linear programs.html new file mode 100644 index 000000000..81a87c253 --- /dev/null +++ b/site/tags/linear programs.html @@ -0,0 +1,193 @@ + + + + + + Tag: linear programs + + + + + +
    + +

    Tag: linear programs

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: linear programs

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/linear systems.html b/site/tags/linear systems.html new file mode 100644 index 000000000..6f3835e8a --- /dev/null +++ b/site/tags/linear systems.html @@ -0,0 +1,193 @@ + + + + + + Tag: linear systems + + + + + +
    + +

    Tag: linear systems

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: linear systems

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/matching.html b/site/tags/matching.html new file mode 100644 index 000000000..c5288b7f9 --- /dev/null +++ b/site/tags/matching.html @@ -0,0 +1,193 @@ + + + + + + Tag: matching + + + + + +
    + +

    Tag: matching

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: matching

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/max flow min cut.html b/site/tags/max flow min cut.html new file mode 100644 index 000000000..52a62048e --- /dev/null +++ b/site/tags/max flow min cut.html @@ -0,0 +1,193 @@ + + + + + + Tag: max flow min cut + + + + + +
    + +

    Tag: max flow min cut

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: max flow min cut

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/odd cycles.html b/site/tags/odd cycles.html new file mode 100644 index 000000000..3c60fb167 --- /dev/null +++ b/site/tags/odd cycles.html @@ -0,0 +1,193 @@ + + + + + + Tag: odd cycles + + + + + +
    + +

    Tag: odd cycles

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: odd cycles

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/optimization.html b/site/tags/optimization.html new file mode 100644 index 000000000..47fe026a4 --- /dev/null +++ b/site/tags/optimization.html @@ -0,0 +1,195 @@ + + + + + + Tag: optimization + + + + + +
    + +

    Tag: optimization

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: optimization

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/partitioning.html b/site/tags/partitioning.html new file mode 100644 index 000000000..db24d0096 --- /dev/null +++ b/site/tags/partitioning.html @@ -0,0 +1,193 @@ + + + + + + Tag: partitioning + + + + + +
    + +

    Tag: partitioning

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: partitioning

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/pigeonhole principle.html b/site/tags/pigeonhole principle.html new file mode 100644 index 000000000..551590e42 --- /dev/null +++ b/site/tags/pigeonhole principle.html @@ -0,0 +1,193 @@ + + + + + + Tag: pigeonhole principle + + + + + +
    + +

    Tag: pigeonhole principle

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: pigeonhole principle

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/problem-solving.html b/site/tags/problem-solving.html new file mode 100644 index 000000000..4d9423b46 --- /dev/null +++ b/site/tags/problem-solving.html @@ -0,0 +1,193 @@ + + + + + + Tag: problem-solving + + + + + +
    + +

    Tag: problem-solving

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: problem-solving

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/proof techniques.html b/site/tags/proof techniques.html new file mode 100644 index 000000000..fcf1750d6 --- /dev/null +++ b/site/tags/proof techniques.html @@ -0,0 +1,194 @@ + + + + + + Tag: proof techniques + + + + + +
    + +

    Tag: proof techniques

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: proof techniques

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/scheduling.html b/site/tags/scheduling.html new file mode 100644 index 000000000..b7f6f0ed5 --- /dev/null +++ b/site/tags/scheduling.html @@ -0,0 +1,193 @@ + + + + + + Tag: scheduling + + + + + +
    + +

    Tag: scheduling

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: scheduling

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/set cover.html b/site/tags/set cover.html new file mode 100644 index 000000000..6ee0351f0 --- /dev/null +++ b/site/tags/set cover.html @@ -0,0 +1,193 @@ + + + + + + Tag: set cover + + + + + +
    + +

    Tag: set cover

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: set cover

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/spanning trees.html b/site/tags/spanning trees.html new file mode 100644 index 000000000..8b9b156e4 --- /dev/null +++ b/site/tags/spanning trees.html @@ -0,0 +1,193 @@ + + + + + + Tag: spanning trees + + + + + +
    + +

    Tag: spanning trees

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: spanning trees

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/stable matching.html b/site/tags/stable matching.html new file mode 100644 index 000000000..50997731b --- /dev/null +++ b/site/tags/stable matching.html @@ -0,0 +1,193 @@ + + + + + + Tag: stable matching + + + + + +
    + +

    Tag: stable matching

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: stable matching

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/time complexity.html b/site/tags/time complexity.html new file mode 100644 index 000000000..9182f549c --- /dev/null +++ b/site/tags/time complexity.html @@ -0,0 +1,193 @@ + + + + + + Tag: time complexity + + + + + +
    + +

    Tag: time complexity

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: time complexity

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/trees.html b/site/tags/trees.html new file mode 100644 index 000000000..d42269002 --- /dev/null +++ b/site/tags/trees.html @@ -0,0 +1,193 @@ + + + + + + Tag: trees + + + + + +
    + +

    Tag: trees

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: trees

    + +
    + +
    + + \ No newline at end of file diff --git a/site/tags/vertex cover.html b/site/tags/vertex cover.html new file mode 100644 index 000000000..e13514ee4 --- /dev/null +++ b/site/tags/vertex cover.html @@ -0,0 +1,194 @@ + + + + + + Tag: vertex cover + + + + + +
    + +

    Tag: vertex cover

    +
    + Last modified: 2025-01-01 + +
    +
    +

    Tag: vertex cover

    + +
    + +
    + + \ No newline at end of file