Categories
Computational problems in graph theory
Topic: Category
From HandWiki - Reading time: 2 min
Here is a list of articles in the category Computational problems in graph theory of the Computing portal that unifies foundations of mathematics and computations using computers. This category lists computational problems that arise in graph theory.
Subcategories
This category has the following 2 subcategories, out of 2 total.
G
S
- Spanning tree (41 P)
Pages in category "Computational problems in graph theory"
The following 74 pages are in this category, out of 74 total.
C
D
F
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
S
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:Computational_problems_in_graph_theory1 | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF