Combinatorics
Jump to navigation
Jump to search
Description
Problems Within Domain
- #2-Graph Coloring
- #3-Graph Coloring
- #4-Graph Coloring
- #5-Graph Coloring
- #k-Graph Coloring
- $(\min, \leq)$ Product
- (5/3)-approximate ap-shortest paths
- 1-sensitive (3/2)-approximate ss-shortest paths
- 1-sensitive decremental st-shortest paths
- 1D Maximum Subarray
- 2 Strong Components (dynamic)
- 2-Graph Coloring
- 2-sensitive (7/5)-approximate st-shortest paths
- 2-sensitive decremental st-shortest paths
- 2D Maximum Subarray
- 3-Graph Coloring
- 4-Graph Coloring
- 5-Graph Coloring
- APSP
- APSP on Dense Directed Graphs with Arbitrary Weights
- APSP on Dense Directed Unweighted Graphs
- APSP on Dense Undirected Graphs with Arbitrary Weights
- APSP on Dense Undirected Graphs with Positive Integer Weights
- APSP on Dense Undirected Unweighted Graphs
- APSP on Geometrically Weighted Graphs
- APSP on Sparse Directed Graphs with Arbitrary Weights
- APSP on Sparse Directed Unweighted Graphs
- APSP on Sparse Undirected Graphs with Arbitrary Weights
- APSP on Sparse Undirected Graphs with Positive Integer Weights
- APSP on Sparse Undirected Unweighted Graphs
- AST to Code Translation
- Acyclic DFA Minimization
- All-Pairs Maximum Flow
- Almost Stable Marriage Problem
- Alphabetic Tree Problem
- Approximate MCOP
- Approximate MCSP
- Approximate OBST
- Approximate TSP
- Bipartite Graph MCM
- Bipartite Maximum-Weight Matching
- Boolean Matrix Multiplication
- Boolean Matrix Multiplication (Combinatorial)
- Boolean d-Attribute Stable Matching
- Change-Making Problem
- Chromatic Number
- Comparison Sorting
- Connected Subgraph
- Constructing Eulerian Trails in a Graph
- Constructing Solutions
- Constructing Suffix Trees
- Counting Solutions
- Cycle Detection
- Cyclic Nontrivial SCCs DFA Minimization
- DAG Realization Problem
- DFA Minimization
- Delaunay Triangulation
- Digraph Realization Problem
- Directed (Optimum Branchings), General MST
- Directed (Optimum Branchings), Super Dense MST
- Distance Product
- Entity Resolution
- Enumerating Maximal Cliques, arbitrary graph
- Exact GED
- Exact k-Clique
- Finding Frequent Itemsets
- Frequent Words with Mismatches Problem
- General Graph MCM
- General Weights
- Graph Isomorphism, General Graphs
- Huffman Encoding
- InDegree Analysis
- Inexact GED
- Integer Maximum Flow
- Largest Common Subtree
- Link Analysis
- Longest Common Subsequence
- Longest Common Substring with don't cares
- Longest Palindromic Substring
- Longest Path on Interval Graphs
- Lowest Common Ancestor
- Lowest Common Ancestor with Linking
- Lowest Common Ancestor with Linking Roots
- Lowest Common Ancestor with Static Trees
- Lowest Common Ancestors with Linking and Cutting
- Matrix Chain Ordering Problem
- Matrix Chain Scheduling Problem
- Matrix Multiplication
- Matrix Product Verification
- Max-Weight k-Clique
- Maximum Cut
- Maximum Local Edge Connectivity
- Maximum Square Subarray
- Maximum Strongly Connected Component
- Maximum Subarray
- Maximum TSP
- Maximum-Weight Matching
- Median String Problem with Binary Alphabets
- Median String Problem with Bounded Alphabets
- Median String Problem with Unbounded Alphabets
- Min-Weight k-Clique
- Minimum TSP
- Minimum Wiener Connector Problem
- Minimum value in each row of an implicitly-defined totally monotone matrix
- Minimum-Cost Flow
- Multiple String Search
- NFA to DFA conversion
- Non-Comparison Sorting
- Non-integer Maximum Flow
- Nonnegative Integer Weights
- Nonnegative Weights
- Off-Line Lowest Common Ancestor
- Optimal Binary Search Tree Problem
- Replacement Paths Problem
- Rod-Cutting Problem
- Second Shortest Simple Path
- Self-Balancing Trees Creation
- Self-Balancing Trees Deletion
- Self-Balancing Trees Insertion
- Self-Balancing Trees Search
- Sequence-To-Graph Alignment
- Single String Search
- Sorting
- Stable Marriage Problem
- Stable Matching Verification
- Stable Pair Checking
- Stable Roommates Problem
- Strong Connectivity (dynamic)
- Strongly Connected Components
- Subset Sum
- Subtree Isomorphism
- The Vertex Cover Problem
- The Vertex Cover Problem, Degrees Bounded By 3
- Topological Sorting
- Tower of Hanoi
- Transitive Closure
- Transitive Reduction Problem of Directed Graphs
- Turnpike Problem
- Undirected Wiener Index
- Undirected, Dense MST
- Undirected, General MST
- Undirected, Integer Weights MST
- Undirected, Planar MST
- Unweighted Maximum Flow
- Unweighted Set-Covering
- Voronoi Diagrams
- Weighted Set-Covering
- k Approximate Nearest Neighbors Search
- k Nearest Neighbors Search
- k-ANNS for a dense 3D map of geometric points
- k-Clique
- k-Graph Coloring
- kth Order Statistic
- n-Queens Completion
- st-Maximum Flow
- st-Shortest Path