Category:Computational problems in graph theory
This category lists computational problems that arise in graph theory.
Subcategories
This category has the following 4 subcategories, out of 4 total.
Pages in category "Computational problems in graph theory"
The following 77 pages are in this category, out of 77 total. This list may not reflect recent changes.
C
D
G
M
- Matching (graph theory)
- MaxDDBS
- Maximal independent set
- Maximum agreement subtree problem
- Maximum common edge subgraph
- Maximum common induced subgraph
- Maximum cut
- Maximum flow problem
- Maximum weight matching
- Metric k-center
- Minimum k-cut
- Minimum-diameter spanning tree
- Mixed Chinese postman problem
- Multi-trials technique